./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i -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 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:02:34,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:02:34,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:02:34,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:02:34,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:02:34,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:02:34,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:02:34,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:02:34,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:02:34,216 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:02:34,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:02:34,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:02:34,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:02:34,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:02:34,219 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:02:34,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:02:34,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:02:34,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:02:34,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:02:34,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:02:34,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:02:34,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:02:34,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:02:34,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:02:34,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:02:34,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:02:34,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:02:34,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:02:34,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:02:34,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:02:34,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:02:34,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:02:34,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:02:34,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:02:34,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:02:34,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:02:34,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:02:34,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:02:34,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:02:34,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:02:34,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:02:34,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:02:34,225 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 -> 7ce79fe11836d82ec064e02fff135ad9866417774e7d276b3384b4d4dde863b5 [2024-10-14 02:02:34,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:02:34,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:02:34,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:02:34,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:02:34,524 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:02:34,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-10-14 02:02:35,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:02:35,969 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:02:35,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i [2024-10-14 02:02:35,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8b2792/09c42e1a293a4e5daf796f5a302d7d5d/FLAG3322d4acd [2024-10-14 02:02:36,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b8b2792/09c42e1a293a4e5daf796f5a302d7d5d [2024-10-14 02:02:36,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:02:36,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:02:36,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:02:36,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:02:36,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:02:36,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5e52f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36, skipping insertion in model container [2024-10-14 02:02:36,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:02:36,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i[800,813] [2024-10-14 02:02:36,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:02:36,531 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:02:36,542 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex1b.i[800,813] [2024-10-14 02:02:36,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:02:36,561 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:02:36,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36 WrapperNode [2024-10-14 02:02:36,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:02:36,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:02:36,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:02:36,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:02:36,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,583 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-10-14 02:02:36,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:02:36,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:02:36,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:02:36,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:02:36,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,598 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 02:02:36,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:02:36,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:02:36,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:02:36,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:02:36,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (1/1) ... [2024-10-14 02:02:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:02:36,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:02:36,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:02:36,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:02:36,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:02:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:02:36,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:02:36,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:02:36,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:02:36,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:02:36,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:02:36,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:02:36,861 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-14 02:02:36,862 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:02:36,895 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:02:36,896 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 02:02:36,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:36 BoogieIcfgContainer [2024-10-14 02:02:36,899 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:02:36,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:02:36,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:02:36,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:02:36,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:02:36" (1/3) ... [2024-10-14 02:02:36,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a03a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:36, skipping insertion in model container [2024-10-14 02:02:36,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:02:36" (2/3) ... [2024-10-14 02:02:36,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a03a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:02:36, skipping insertion in model container [2024-10-14 02:02:36,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:36" (3/3) ... [2024-10-14 02:02:36,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex1b.i [2024-10-14 02:02:36,921 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:02:36,922 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:02:36,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:02:36,987 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;@4ea73ad0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:02:36,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:02:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 12 states have internal predecessors, (16), 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-10-14 02:02:36,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 02:02:36,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:36,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 02:02:36,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1765644766, now seen corresponding path program 1 times [2024-10-14 02:02:37,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:37,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054642135] [2024-10-14 02:02:37,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:37,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:02:37,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:37,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054642135] [2024-10-14 02:02:37,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054642135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:37,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:37,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:02:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072647862] [2024-10-14 02:02:37,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:37,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:02:37,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:02:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:02:37,201 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.6) internal successors, (16), 12 states have internal predecessors, (16), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:37,232 INFO L93 Difference]: Finished difference Result 38 states and 64 transitions. [2024-10-14 02:02:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:02:37,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 02:02:37,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:37,242 INFO L225 Difference]: With dead ends: 38 [2024-10-14 02:02:37,243 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 02:02:37,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:02:37,249 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 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-10-14 02:02:37,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 02:02:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2024-10-14 02:02:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:02:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-14 02:02:37,279 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 6 [2024-10-14 02:02:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:37,280 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-14 02:02:37,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-10-14 02:02:37,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:02:37,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:37,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:37,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:02:37,281 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:37,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1123983028, now seen corresponding path program 1 times [2024-10-14 02:02:37,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:37,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188951079] [2024-10-14 02:02:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:37,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:02:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188951079] [2024-10-14 02:02:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188951079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:37,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 02:02:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198419418] [2024-10-14 02:02:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:37,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:02:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:37,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:02:37,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:02:37,341 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:37,356 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-10-14 02:02:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:02:37,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 02:02:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:37,357 INFO L225 Difference]: With dead ends: 31 [2024-10-14 02:02:37,357 INFO L226 Difference]: Without dead ends: 17 [2024-10-14 02:02:37,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:02:37,360 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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-10-14 02:02:37,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-14 02:02:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-14 02:02:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:02:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-14 02:02:37,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2024-10-14 02:02:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:37,367 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-14 02:02:37,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-14 02:02:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:02:37,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:37,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:37,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:02:37,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:37,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1125770488, now seen corresponding path program 1 times [2024-10-14 02:02:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076880090] [2024-10-14 02:02:37,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:02:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:37,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076880090] [2024-10-14 02:02:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076880090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:37,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:37,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812386192] [2024-10-14 02:02:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:37,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:37,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:37,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:37,479 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:37,527 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-14 02:02:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 02:02:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:37,528 INFO L225 Difference]: With dead ends: 38 [2024-10-14 02:02:37,528 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 02:02:37,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:37,534 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:37,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 61 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 02:02:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-14 02:02:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:02:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-14 02:02:37,544 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 7 [2024-10-14 02:02:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:37,544 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-14 02:02:37,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-14 02:02:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 02:02:37,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:37,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:37,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:02:37,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:37,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2094727634, now seen corresponding path program 1 times [2024-10-14 02:02:37,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:37,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028823849] [2024-10-14 02:02:37,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:37,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 02:02:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028823849] [2024-10-14 02:02:37,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028823849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:37,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:37,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:02:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315165257] [2024-10-14 02:02:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:02:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:37,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:02:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:02:37,646 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 02:02:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:37,687 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-14 02:02:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:02:37,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-14 02:02:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:37,688 INFO L225 Difference]: With dead ends: 29 [2024-10-14 02:02:37,688 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 02:02:37,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:37,689 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:37,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 02:02:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 02:02:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:02:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-10-14 02:02:37,700 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2024-10-14 02:02:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:37,701 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-10-14 02:02:37,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 02:02:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-10-14 02:02:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 02:02:37,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:37,704 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:37,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:02:37,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:37,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -599110424, now seen corresponding path program 1 times [2024-10-14 02:02:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923911107] [2024-10-14 02:02:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:02:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 02:02:37,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:37,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923911107] [2024-10-14 02:02:37,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923911107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:37,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117527065] [2024-10-14 02:02:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:37,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:37,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:37,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:37,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:37,838 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 02:02:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:37,870 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-14 02:02:37,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:37,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-14 02:02:37,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:37,871 INFO L225 Difference]: With dead ends: 33 [2024-10-14 02:02:37,871 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 02:02:37,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:37,872 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:37,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 02:02:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 02:02:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:02:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-10-14 02:02:37,877 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 19 [2024-10-14 02:02:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:37,877 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-14 02:02:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 02:02:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-10-14 02:02:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 02:02:37,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:37,878 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:02:37,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1350974078, now seen corresponding path program 1 times [2024-10-14 02:02:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626965655] [2024-10-14 02:02:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:02:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:02:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 02:02:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626965655] [2024-10-14 02:02:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626965655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:37,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:37,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:37,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821691203] [2024-10-14 02:02:37,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:37,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:37,969 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:02:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:38,037 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2024-10-14 02:02:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-14 02:02:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:38,040 INFO L225 Difference]: With dead ends: 59 [2024-10-14 02:02:38,040 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 02:02:38,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:38,042 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:38,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 02:02:38,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2024-10-14 02:02:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:02:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-10-14 02:02:38,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 25 [2024-10-14 02:02:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:38,055 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-10-14 02:02:38,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 02:02:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-10-14 02:02:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 02:02:38,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:38,060 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 02:02:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:02:38,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:38,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1075342931, now seen corresponding path program 1 times [2024-10-14 02:02:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023524356] [2024-10-14 02:02:38,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:02:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:02:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:02:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:02:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:02:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:02:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-10-14 02:02:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023524356] [2024-10-14 02:02:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023524356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:02:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103201503] [2024-10-14 02:02:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:02:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:38,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:02:38,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:02:38,175 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 02:02:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:38,218 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-10-14 02:02:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:02:38,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-14 02:02:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:38,219 INFO L225 Difference]: With dead ends: 51 [2024-10-14 02:02:38,219 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 02:02:38,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:38,220 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:38,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 02:02:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 02:02:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 02:02:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-10-14 02:02:38,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 51 [2024-10-14 02:02:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:38,227 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-10-14 02:02:38,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 02:02:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-10-14 02:02:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:02:38,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:02:38,228 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 02:02:38,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:02:38,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:02:38,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:02:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1962364672, now seen corresponding path program 1 times [2024-10-14 02:02:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:02:38,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582554302] [2024-10-14 02:02:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:02:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:02:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 02:02:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:02:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:02:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:02:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:02:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:02:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:02:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:02:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:02:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-14 02:02:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:02:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582554302] [2024-10-14 02:02:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582554302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:02:38,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:02:38,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:02:38,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925941066] [2024-10-14 02:02:38,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:02:38,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:02:38,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:02:38,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:02:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:02:38,369 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 02:02:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:02:38,434 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-10-14 02:02:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:02:38,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2024-10-14 02:02:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:02:38,440 INFO L225 Difference]: With dead ends: 47 [2024-10-14 02:02:38,440 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 02:02:38,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:02:38,441 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:02:38,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:02:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 02:02:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 02:02:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:02:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 02:02:38,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2024-10-14 02:02:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:02:38,444 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 02:02:38,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 02:02:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 02:02:38,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 02:02:38,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:02:38,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:02:38,452 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:02:38,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 02:02:38,555 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:02:38,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:02:38 BoogieIcfgContainer [2024-10-14 02:02:38,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:02:38,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:02:38,568 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:02:38,568 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:02:38,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:02:36" (3/4) ... [2024-10-14 02:02:38,570 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 02:02:38,573 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-14 02:02:38,576 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-14 02:02:38,576 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 02:02:38,576 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 02:02:38,576 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 02:02:38,639 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:02:38,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 02:02:38,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:02:38,640 INFO L158 Benchmark]: Toolchain (without parser) took 2241.56ms. Allocated memory is still 184.5MB. Free memory was 148.6MB in the beginning and 150.0MB in the end (delta: -1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:02:38,640 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 184.5MB. Free memory was 155.7MB in the beginning and 155.5MB in the end (delta: 181.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:02:38,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.64ms. Allocated memory is still 184.5MB. Free memory was 147.9MB in the beginning and 136.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 02:02:38,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.02ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 135.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:02:38,641 INFO L158 Benchmark]: Boogie Preprocessor took 19.75ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 133.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:02:38,641 INFO L158 Benchmark]: RCFGBuilder took 295.03ms. Allocated memory is still 184.5MB. Free memory was 133.9MB in the beginning and 123.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 02:02:38,641 INFO L158 Benchmark]: TraceAbstraction took 1667.19ms. Allocated memory is still 184.5MB. Free memory was 122.7MB in the beginning and 154.2MB in the end (delta: -31.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2024-10-14 02:02:38,641 INFO L158 Benchmark]: Witness Printer took 71.40ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 150.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 02:02:38,643 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.30ms. Allocated memory is still 184.5MB. Free memory was 155.7MB in the beginning and 155.5MB in the end (delta: 181.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.64ms. Allocated memory is still 184.5MB. Free memory was 147.9MB in the beginning and 136.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.02ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 135.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.75ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 133.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 295.03ms. Allocated memory is still 184.5MB. Free memory was 133.9MB in the beginning and 123.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1667.19ms. Allocated memory is still 184.5MB. Free memory was 122.7MB in the beginning and 154.2MB in the end (delta: -31.4MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Witness Printer took 71.40ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 150.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: 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, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 117 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=7, InterpolantAutomatonStates: 42, 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, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 317/317 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: 16]: Loop Invariant Derived loop invariant: (i < 101) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((i <= 99) && (j <= 100)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-14 02:02:38,664 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