/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:45:30,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:45:30,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:45:30,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:45:30,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:45:30,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:45:30,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:45:30,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:45:30,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:45:30,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:45:30,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:45:30,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:45:30,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:45:30,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:45:30,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:45:30,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:45:30,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:45:30,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:45:30,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:45:30,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:45:30,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:45:30,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:45:30,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:45:30,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:45:30,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:45:30,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:45:30,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:45:30,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:45:30,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:45:30,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:45:30,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:45:30,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:45:30,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:45:30,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:45:30,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:45:30,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:45:30,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:45:30,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:45:30,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:45:30,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:45:30,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:45:30,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 02:45:30,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:45:30,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:45:30,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:45:30,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:45:30,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:45:30,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:45:30,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:45:30,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:45:30,349 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:45:30,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:45:30,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:45:30,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:45:30,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:45:30,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:45:30,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:45:30,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:45:30,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:45:30,352 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:45:30,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:45:30,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:45:30,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:45:30,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:45:30,566 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:45:30,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-01-10 02:45:30,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff047a784/3f59b4ec523a4fd381ec1a91f5db9b41/FLAGc00c53ca0 [2022-01-10 02:45:30,981 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:45:30,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-01-10 02:45:30,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff047a784/3f59b4ec523a4fd381ec1a91f5db9b41/FLAGc00c53ca0 [2022-01-10 02:45:31,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff047a784/3f59b4ec523a4fd381ec1a91f5db9b41 [2022-01-10 02:45:31,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:45:31,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:45:31,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:45:31,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:45:31,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:45:31,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4d047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31, skipping insertion in model container [2022-01-10 02:45:31,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:45:31,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:45:31,552 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2022-01-10 02:45:31,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:45:31,595 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:45:31,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2022-01-10 02:45:31,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:45:31,646 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:45:31,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31 WrapperNode [2022-01-10 02:45:31,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:45:31,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:45:31,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:45:31,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:45:31,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,685 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-01-10 02:45:31,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:45:31,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:45:31,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:45:31,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:45:31,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:45:31,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:45:31,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:45:31,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:45:31,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (1/1) ... [2022-01-10 02:45:31,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:45:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:45:31,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:45:31,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:45:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:45:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:45:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:45:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:45:31,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 02:45:31,828 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 02:45:31,877 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:45:31,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:45:32,070 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:45:32,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:45:32,075 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 02:45:32,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:45:32 BoogieIcfgContainer [2022-01-10 02:45:32,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:45:32,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:45:32,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:45:32,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:45:32,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:45:31" (1/3) ... [2022-01-10 02:45:32,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbf52ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:45:32, skipping insertion in model container [2022-01-10 02:45:32,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:45:31" (2/3) ... [2022-01-10 02:45:32,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbf52ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:45:32, skipping insertion in model container [2022-01-10 02:45:32,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:45:32" (3/3) ... [2022-01-10 02:45:32,099 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-01-10 02:45:32,102 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:45:32,102 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:45:32,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:45:32,159 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:45:32,159 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:45:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-10 02:45:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 02:45:32,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:32,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:32,183 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 92586222, now seen corresponding path program 1 times [2022-01-10 02:45:32,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:32,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545101145] [2022-01-10 02:45:32,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:32,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:32,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:32,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:32,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 02:45:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:32,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 02:45:32,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:45:32,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:45:32,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545101145] [2022-01-10 02:45:32,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545101145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:45:32,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:45:32,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:45:32,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224330007] [2022-01-10 02:45:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:45:32,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:45:32,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:45:32,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:45:32,777 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) [2022-01-10 02:45:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:33,099 INFO L93 Difference]: Finished difference Result 130 states and 240 transitions. [2022-01-10 02:45:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:45:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 13 [2022-01-10 02:45:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:33,108 INFO L225 Difference]: With dead ends: 130 [2022-01-10 02:45:33,108 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 02:45:33,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:45:33,113 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 98 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:33,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 369 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 110 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-01-10 02:45:33,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 02:45:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2022-01-10 02:45:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-01-10 02:45:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2022-01-10 02:45:33,166 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 13 [2022-01-10 02:45:33,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:33,166 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2022-01-10 02:45:33,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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) [2022-01-10 02:45:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2022-01-10 02:45:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 02:45:33,167 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:33,168 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:33,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:33,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:33,374 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:33,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 506264748, now seen corresponding path program 1 times [2022-01-10 02:45:33,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257641357] [2022-01-10 02:45:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:33,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:33,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:33,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 02:45:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:33,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:45:33,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:45:33,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:45:33,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:33,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257641357] [2022-01-10 02:45:33,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257641357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:45:33,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:45:33,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:45:33,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143057812] [2022-01-10 02:45:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:45:33,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:45:33,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:45:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:45:33,555 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-01-10 02:45:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:33,677 INFO L93 Difference]: Finished difference Result 64 states and 90 transitions. [2022-01-10 02:45:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:45:33,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 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 18 [2022-01-10 02:45:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:33,679 INFO L225 Difference]: With dead ends: 64 [2022-01-10 02:45:33,679 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 02:45:33,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:45:33,680 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:33,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 281 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:45:33,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 02:45:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-01-10 02:45:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.1875) internal successors, (38), 36 states have internal predecessors, (38), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-10 02:45:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2022-01-10 02:45:33,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 18 [2022-01-10 02:45:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:33,690 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2022-01-10 02:45:33,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 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) [2022-01-10 02:45:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2022-01-10 02:45:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 02:45:33,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:33,691 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:33,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:33,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:33,900 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash -215164411, now seen corresponding path program 1 times [2022-01-10 02:45:33,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:33,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372389842] [2022-01-10 02:45:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:33,901 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:33,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:33,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 02:45:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:33,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 02:45:33,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 02:45:34,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 02:45:34,657 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:34,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372389842] [2022-01-10 02:45:34,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372389842] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:34,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:34,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2022-01-10 02:45:34,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449476520] [2022-01-10 02:45:34,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:34,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 02:45:34,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:34,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 02:45:34,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:45:34,659 INFO L87 Difference]: Start difference. First operand 60 states and 86 transitions. Second operand has 17 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 02:45:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:35,357 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2022-01-10 02:45:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:45:35,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-01-10 02:45:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:35,360 INFO L225 Difference]: With dead ends: 74 [2022-01-10 02:45:35,360 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 02:45:35,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:45:35,361 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:35,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 251 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 289 Invalid, 0 Unknown, 71 Unchecked, 0.6s Time] [2022-01-10 02:45:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 02:45:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2022-01-10 02:45:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-01-10 02:45:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2022-01-10 02:45:35,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 24 [2022-01-10 02:45:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:35,371 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2022-01-10 02:45:35,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 02:45:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2022-01-10 02:45:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 02:45:35,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:35,372 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:35,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:35,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:35,579 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1565563637, now seen corresponding path program 1 times [2022-01-10 02:45:35,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:35,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160815643] [2022-01-10 02:45:35,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:35,580 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:35,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:35,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:35,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 02:45:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:35,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:45:35,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 02:45:35,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 02:45:35,784 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:35,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160815643] [2022-01-10 02:45:35,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160815643] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:35,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:35,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-01-10 02:45:35,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503597000] [2022-01-10 02:45:35,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:35,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:45:35,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:35,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:45:35,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:45:35,786 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:45:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:35,969 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-01-10 02:45:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:45:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-01-10 02:45:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:35,971 INFO L225 Difference]: With dead ends: 72 [2022-01-10 02:45:35,971 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 02:45:35,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:45:35,972 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:35,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 154 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:45:35,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 02:45:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-01-10 02:45:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 43 states have internal predecessors, (45), 25 states have call successors, (25), 5 states have call predecessors, (25), 5 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-10 02:45:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2022-01-10 02:45:35,981 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 35 [2022-01-10 02:45:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:35,982 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2022-01-10 02:45:35,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 02:45:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2022-01-10 02:45:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 02:45:35,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:35,983 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:35,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 02:45:36,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:36,190 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1995086387, now seen corresponding path program 1 times [2022-01-10 02:45:36,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:36,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745776529] [2022-01-10 02:45:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:36,191 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:36,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:36,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 02:45:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:36,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:45:36,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-10 02:45:36,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:45:36,275 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:36,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745776529] [2022-01-10 02:45:36,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745776529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:45:36,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:45:36,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:45:36,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388687271] [2022-01-10 02:45:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:45:36,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:45:36,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:36,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:45:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:45:36,277 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 02:45:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:36,301 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2022-01-10 02:45:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:45:36,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2022-01-10 02:45:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:36,302 INFO L225 Difference]: With dead ends: 109 [2022-01-10 02:45:36,303 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 02:45:36,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:45:36,304 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:36,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:45:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 02:45:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-01-10 02:45:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 44 states have internal predecessors, (44), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-10 02:45:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-01-10 02:45:36,329 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 46 [2022-01-10 02:45:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:36,329 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-01-10 02:45:36,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-10 02:45:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-01-10 02:45:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 02:45:36,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:36,330 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:36,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:36,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:36,537 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 252744692, now seen corresponding path program 1 times [2022-01-10 02:45:36,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:36,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305514953] [2022-01-10 02:45:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:36,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:36,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 02:45:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:36,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 02:45:36,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-01-10 02:45:37,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 02:45:37,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305514953] [2022-01-10 02:45:37,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305514953] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:37,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:37,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2022-01-10 02:45:37,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422395675] [2022-01-10 02:45:37,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:37,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 02:45:37,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 02:45:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:45:37,751 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 02:45:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:39,197 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2022-01-10 02:45:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:45:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2022-01-10 02:45:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:39,199 INFO L225 Difference]: With dead ends: 79 [2022-01-10 02:45:39,199 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 02:45:39,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-01-10 02:45:39,200 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:39,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 154 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 145 Invalid, 0 Unknown, 21 Unchecked, 1.3s Time] [2022-01-10 02:45:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 02:45:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-01-10 02:45:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.119047619047619) internal successors, (47), 47 states have internal predecessors, (47), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-10 02:45:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-01-10 02:45:39,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 47 [2022-01-10 02:45:39,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:39,210 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-01-10 02:45:39,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 02:45:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-01-10 02:45:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-10 02:45:39,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:39,211 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:39,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 02:45:39,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:39,417 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1846987904, now seen corresponding path program 1 times [2022-01-10 02:45:39,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:39,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010582547] [2022-01-10 02:45:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:39,418 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:39,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:39,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:39,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 02:45:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:39,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 02:45:39,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-10 02:45:39,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 02:45:40,311 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:40,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010582547] [2022-01-10 02:45:40,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010582547] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:40,311 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:40,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 20 [2022-01-10 02:45:40,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274919581] [2022-01-10 02:45:40,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:40,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 02:45:40,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 02:45:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-01-10 02:45:40,312 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 20 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-01-10 02:45:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:41,164 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-01-10 02:45:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:45:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 48 [2022-01-10 02:45:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:41,166 INFO L225 Difference]: With dead ends: 84 [2022-01-10 02:45:41,166 INFO L226 Difference]: Without dead ends: 80 [2022-01-10 02:45:41,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2022-01-10 02:45:41,167 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 111 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:41,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 321 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 02:45:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-10 02:45:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-01-10 02:45:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-10 02:45:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-01-10 02:45:41,178 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 48 [2022-01-10 02:45:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:41,179 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-01-10 02:45:41,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 19 states have internal predecessors, (39), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-01-10 02:45:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-01-10 02:45:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 02:45:41,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:41,184 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:41,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:41,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:41,392 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1442608785, now seen corresponding path program 1 times [2022-01-10 02:45:41,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:41,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270593771] [2022-01-10 02:45:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:41,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:41,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:41,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 02:45:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:41,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 02:45:41,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 02:45:42,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 02:45:42,525 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:42,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270593771] [2022-01-10 02:45:42,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270593771] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:42,525 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:42,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2022-01-10 02:45:42,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991453030] [2022-01-10 02:45:42,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:42,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 02:45:42,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 02:45:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-01-10 02:45:42,527 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 02:45:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:43,590 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-01-10 02:45:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:45:43,591 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 49 [2022-01-10 02:45:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:43,592 INFO L225 Difference]: With dead ends: 88 [2022-01-10 02:45:43,592 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 02:45:43,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-01-10 02:45:43,592 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 64 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:43,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 275 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 162 Invalid, 0 Unknown, 49 Unchecked, 0.9s Time] [2022-01-10 02:45:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 02:45:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-01-10 02:45:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 55 states have internal predecessors, (55), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-10 02:45:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 105 transitions. [2022-01-10 02:45:43,601 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 105 transitions. Word has length 49 [2022-01-10 02:45:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:43,601 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 105 transitions. [2022-01-10 02:45:43,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 02:45:43,602 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 105 transitions. [2022-01-10 02:45:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 02:45:43,602 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:43,602 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:43,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:43,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:43,809 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1440880907, now seen corresponding path program 1 times [2022-01-10 02:45:43,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:43,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294135758] [2022-01-10 02:45:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:43,810 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:43,811 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:43,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 02:45:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:43,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 02:45:43,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 02:45:44,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 02:45:44,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:44,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294135758] [2022-01-10 02:45:44,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294135758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:44,982 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:44,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2022-01-10 02:45:44,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432725875] [2022-01-10 02:45:44,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:44,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 02:45:44,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 02:45:44,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-01-10 02:45:44,984 INFO L87 Difference]: Start difference. First operand 86 states and 105 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 02:45:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:46,853 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2022-01-10 02:45:46,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:45:46,854 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 49 [2022-01-10 02:45:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:46,855 INFO L225 Difference]: With dead ends: 99 [2022-01-10 02:45:46,855 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 02:45:46,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-01-10 02:45:46,855 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 85 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:46,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 270 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 232 Invalid, 0 Unknown, 40 Unchecked, 1.7s Time] [2022-01-10 02:45:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 02:45:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-01-10 02:45:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 62 states have internal predecessors, (63), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-10 02:45:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-01-10 02:45:46,868 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 49 [2022-01-10 02:45:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:46,868 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-01-10 02:45:46,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-01-10 02:45:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-01-10 02:45:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 02:45:46,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:46,869 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:46,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:47,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:47,069 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:47,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 238143732, now seen corresponding path program 1 times [2022-01-10 02:45:47,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:47,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546078839] [2022-01-10 02:45:47,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:47,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:47,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:47,072 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:47,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 02:45:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:47,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 02:45:47,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-01-10 02:45:47,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:45:47,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:47,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546078839] [2022-01-10 02:45:47,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546078839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:45:47,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:45:47,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:45:47,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783377391] [2022-01-10 02:45:47,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:45:47,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:45:47,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:47,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:45:47,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:45:47,383 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:45:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:47,568 INFO L93 Difference]: Finished difference Result 116 states and 142 transitions. [2022-01-10 02:45:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:45:47,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2022-01-10 02:45:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:47,571 INFO L225 Difference]: With dead ends: 116 [2022-01-10 02:45:47,571 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 02:45:47,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:45:47,572 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 34 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:47,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 264 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:45:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 02:45:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2022-01-10 02:45:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 69 states have internal predecessors, (70), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2022-01-10 02:45:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-01-10 02:45:47,592 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 81 [2022-01-10 02:45:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:47,594 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-01-10 02:45:47,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-10 02:45:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-01-10 02:45:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 02:45:47,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:47,596 INFO L514 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:47,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:47,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:47,803 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:47,803 INFO L85 PathProgramCache]: Analyzing trace with hash -305953497, now seen corresponding path program 1 times [2022-01-10 02:45:47,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:47,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466236018] [2022-01-10 02:45:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:45:47,804 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:47,806 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 02:45:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:45:47,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 02:45:47,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-01-10 02:45:48,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 76 proven. 16 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-01-10 02:45:48,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:48,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466236018] [2022-01-10 02:45:48,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466236018] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:48,633 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:48,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2022-01-10 02:45:48,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879040265] [2022-01-10 02:45:48,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:48,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 02:45:48,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:48,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 02:45:48,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:45:48,635 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 18 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2022-01-10 02:45:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:49,360 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2022-01-10 02:45:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:45:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) Word has length 114 [2022-01-10 02:45:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:49,362 INFO L225 Difference]: With dead ends: 135 [2022-01-10 02:45:49,362 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 02:45:49,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-01-10 02:45:49,362 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 77 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:49,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 429 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:45:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 02:45:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2022-01-10 02:45:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 76 states have internal predecessors, (77), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-01-10 02:45:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2022-01-10 02:45:49,374 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 114 [2022-01-10 02:45:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:49,374 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2022-01-10 02:45:49,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 7 states have call predecessors, (36), 8 states have call successors, (36) [2022-01-10 02:45:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2022-01-10 02:45:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 02:45:49,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:45:49,376 INFO L514 BasicCegarLoop]: trace histogram [26, 25, 25, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:49,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:45:49,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:49,579 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:45:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:45:49,580 INFO L85 PathProgramCache]: Analyzing trace with hash -252035450, now seen corresponding path program 2 times [2022-01-10 02:45:49,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:45:49,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838275928] [2022-01-10 02:45:49,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:45:49,581 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:45:49,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:45:49,582 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:45:49,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 02:45:49,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:45:49,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:45:49,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:45:49,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:45:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 50 proven. 21 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-01-10 02:45:49,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:45:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 50 proven. 21 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2022-01-10 02:45:50,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:45:50,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838275928] [2022-01-10 02:45:50,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838275928] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:45:50,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:45:50,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-01-10 02:45:50,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279849533] [2022-01-10 02:45:50,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:45:50,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:45:50,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:45:50,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:45:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:45:50,133 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-01-10 02:45:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:45:50,492 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2022-01-10 02:45:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:45:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) Word has length 152 [2022-01-10 02:45:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:45:50,493 INFO L225 Difference]: With dead ends: 170 [2022-01-10 02:45:50,493 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 02:45:50,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:45:50,495 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 48 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:45:50,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 738 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:45:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 02:45:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 02:45:50,496 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) [2022-01-10 02:45:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 02:45:50,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2022-01-10 02:45:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:45:50,497 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 02:45:50,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 9 states have call successors, (44), 3 states have call predecessors, (44), 1 states have return successors, (42), 9 states have call predecessors, (42), 9 states have call successors, (42) [2022-01-10 02:45:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 02:45:50,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 02:45:50,499 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 02:45:50,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 02:45:50,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:45:50,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 02:45:54,223 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-01-10 02:45:54,223 INFO L858 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-01-10 02:45:54,223 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 02:45:54,223 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-01-10 02:45:54,223 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 02:45:54,223 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32))) (.cse1 (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32))) (.cse2 (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|))) (.cse3 (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32))) (.cse4 (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32))) (.cse5 (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) .cse5 (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|) .cse4 .cse5))) [2022-01-10 02:45:54,223 INFO L854 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L858 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-01-10 02:45:54,224 INFO L858 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (let ((.cse0 (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32))) (.cse1 (bvsgt |ULTIMATE.start_main_~urilen~0#1| (_ bv0 32))) (.cse2 (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32))) (.cse3 (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|))) (.cse4 (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,224 INFO L854 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,225 INFO L854 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L854 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L854 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L861 garLoopResultBuilder]: At program point L82(lines 24 83) the Hoare annotation is: true [2022-01-10 02:45:54,225 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,225 INFO L854 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L858 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-01-10 02:45:54,225 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,226 INFO L854 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (bvsgt |ULTIMATE.start_main_~tokenlen~0#1| (_ bv0 32)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,226 INFO L854 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 32)) |ULTIMATE.start_main_~tokenlen~0#1|) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (not (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~urilen~0#1|) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L854 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (bvslt |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~tokenlen~0#1|) (bvsle |ULTIMATE.start_main_~urilen~0#1| (_ bv1000000 32)) (bvsle (_ bv0 32) |ULTIMATE.start_main_~c~0#1|) (bvsle (_ bv0 32) (bvadd (_ bv4294967294 32) |ULTIMATE.start_main_~cp~0#1|)) (bvsle |ULTIMATE.start_main_~scheme~0#1| (_ bv1000000 32)) (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 32)) |ULTIMATE.start_main_~tokenlen~0#1|) (bvsge |ULTIMATE.start_main_~scheme~0#1| (_ bv0 32)) (bvsge |ULTIMATE.start_main_~cp~0#1| (_ bv0 32)) (not (= (bvadd (_ bv1 32) |ULTIMATE.start_main_~cp~0#1|) |ULTIMATE.start_main_~urilen~0#1|)) (bvslt |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (bvsle |ULTIMATE.start_main_~tokenlen~0#1| (_ bv1000000 32))) [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L43(lines 25 83) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L68(lines 66 77) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-01-10 02:45:54,226 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-01-10 02:45:54,227 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-01-10 02:45:54,227 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-01-10 02:45:54,229 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:45:54,229 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 02:45:54,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:45:54 BoogieIcfgContainer [2022-01-10 02:45:54,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 02:45:54,242 INFO L158 Benchmark]: Toolchain (without parser) took 22839.36ms. Allocated memory was 168.8MB in the beginning and 247.5MB in the end (delta: 78.6MB). Free memory was 114.4MB in the beginning and 145.9MB in the end (delta: -31.5MB). Peak memory consumption was 113.9MB. Max. memory is 8.0GB. [2022-01-10 02:45:54,243 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 02:45:54,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.01ms. Allocated memory was 168.8MB in the beginning and 205.5MB in the end (delta: 36.7MB). Free memory was 114.2MB in the beginning and 178.3MB in the end (delta: -64.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-01-10 02:45:54,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.44ms. Allocated memory is still 205.5MB. Free memory was 178.3MB in the beginning and 176.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 02:45:54,243 INFO L158 Benchmark]: Boogie Preprocessor took 33.97ms. Allocated memory is still 205.5MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 02:45:54,243 INFO L158 Benchmark]: RCFGBuilder took 355.09ms. Allocated memory is still 205.5MB. Free memory was 174.9MB in the beginning and 162.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 02:45:54,244 INFO L158 Benchmark]: TraceAbstraction took 22165.18ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 161.8MB in the beginning and 145.9MB in the end (delta: 15.9MB). Peak memory consumption was 125.0MB. Max. memory is 8.0GB. [2022-01-10 02:45:54,245 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 168.8MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.01ms. Allocated memory was 168.8MB in the beginning and 205.5MB in the end (delta: 36.7MB). Free memory was 114.2MB in the beginning and 178.3MB in the end (delta: -64.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.44ms. Allocated memory is still 205.5MB. Free memory was 178.3MB in the beginning and 176.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.97ms. Allocated memory is still 205.5MB. Free memory was 176.5MB in the beginning and 174.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 355.09ms. Allocated memory is still 205.5MB. Free memory was 174.9MB in the beginning and 162.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 22165.18ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 161.8MB in the beginning and 145.9MB in the end (delta: 15.9MB). Peak memory consumption was 125.0MB. Max. memory is 8.0GB. * 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 3623 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 2970 mSDsCounter, 1002 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2450 IncrementalHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1002 mSolverCounterUnsat, 653 mSDtfsCounter, 2450 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1229 GetRequests, 1038 SyntacticMatches, 8 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=11, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 57 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 117 PreInvPairs, 203 NumberOfFragments, 735 HoareAnnotationTreeSize, 117 FomulaSimplifications, 6019 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 23 FomulaSimplificationsInter, 17518 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1174 ConstructedInterpolants, 5 QuantifiedInterpolants, 3858 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1097 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 4672/4878 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: 46]: Loop Invariant Derived loop invariant: ((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvsle32(0bv32, ~bvadd16(4294967295bv32, cp))) && ~bvsge32(scheme, 0bv32)) && ~bvsge32(cp, 0bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(cp, urilen)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((~bvslt32(c, tokenlen) && ~bvsle32(urilen, 1000000bv32)) && ~bvsle32(0bv32, c)) && ~bvsle32(0bv32, ~bvadd16(4294967294bv32, cp))) && ~bvsle32(scheme, 1000000bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvslt32(~bvadd16(4294967295bv32, cp), urilen)) && ~bvsge32(cp, 0bv32)) && !~bvslt32(~bvadd16(4294967295bv32, urilen), cp)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 02:45:54,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...