/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/nla-digbench-scaling/hard-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:18:56,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:18:56,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:18:56,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:18:56,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:18:56,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:18:57,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:18:57,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:18:57,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:18:57,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:18:57,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:18:57,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:18:57,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:18:57,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:18:57,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:18:57,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:18:57,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:18:57,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:18:57,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:18:57,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:18:57,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:18:57,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:18:57,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:18:57,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:18:57,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:18:57,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:18:57,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:18:57,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:18:57,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:18:57,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:18:57,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:18:57,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:18:57,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:18:57,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:18:57,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:18:57,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:18:57,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:18:57,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:18:57,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:18:57,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:18:57,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:18:57,035 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 03:18:57,063 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:18:57,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:18:57,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:18:57,064 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:18:57,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:18:57,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:18:57,065 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:18:57,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:18:57,065 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:18:57,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:18:57,066 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:18:57,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:18:57,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:18:57,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:18:57,068 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:18:57,068 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:18:57,068 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:18:57,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:18:57,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:18:57,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:18:57,068 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 03:18:57,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:18:57,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:18:57,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:18:57,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:18:57,401 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:18:57,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-01-10 03:18:57,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d1107e8/024ede4eda1b40c0bdcb232f147e6205/FLAG2e74c358c [2022-01-10 03:18:57,885 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:18:57,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-01-10 03:18:57,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d1107e8/024ede4eda1b40c0bdcb232f147e6205/FLAG2e74c358c [2022-01-10 03:18:58,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d1107e8/024ede4eda1b40c0bdcb232f147e6205 [2022-01-10 03:18:58,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:18:58,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:18:58,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:18:58,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:18:58,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:18:58,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7afabcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58, skipping insertion in model container [2022-01-10 03:18:58,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:18:58,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:18:58,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c[537,550] [2022-01-10 03:18:58,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:18:58,576 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:18:58,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c[537,550] [2022-01-10 03:18:58,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:18:58,617 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:18:58,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58 WrapperNode [2022-01-10 03:18:58,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:18:58,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:18:58,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:18:58,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:18:58,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,649 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-01-10 03:18:58,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:18:58,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:18:58,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:18:58,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:18:58,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:18:58,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:18:58,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:18:58,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:18:58,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (1/1) ... [2022-01-10 03:18:58,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:18:58,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:18:58,779 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 03:18:58,815 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 03:18:58,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:18:58,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:18:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:18:58,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:18:58,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:18:58,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:18:58,884 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:18:58,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:18:59,018 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:18:59,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:18:59,022 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 03:18:59,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:18:59 BoogieIcfgContainer [2022-01-10 03:18:59,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:18:59,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:18:59,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:18:59,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:18:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:18:58" (1/3) ... [2022-01-10 03:18:59,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:18:59, skipping insertion in model container [2022-01-10 03:18:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:18:58" (2/3) ... [2022-01-10 03:18:59,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e371e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:18:59, skipping insertion in model container [2022-01-10 03:18:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:18:59" (3/3) ... [2022-01-10 03:18:59,043 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound2.c [2022-01-10 03:18:59,047 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:18:59,047 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:18:59,073 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:18:59,077 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 03:18:59,077 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:18:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 03:18:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:18:59,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:18:59,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:18:59,089 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:18:59,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:18:59,092 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-01-10 03:18:59,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:18:59,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958659230] [2022-01-10 03:18:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:18:59,100 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:18:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:18:59,102 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 03:18:59,103 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 03:18:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:18:59,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:18:59,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:18:59,174 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 03:18:59,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:18:59,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:18:59,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958659230] [2022-01-10 03:18:59,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958659230] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:18:59,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:18:59,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:18:59,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695752096] [2022-01-10 03:18:59,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:18:59,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:18:59,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:18:59,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:18:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:18:59,200 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 03:18:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:18:59,213 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-01-10 03:18:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:18:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2022-01-10 03:18:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:18:59,219 INFO L225 Difference]: With dead ends: 53 [2022-01-10 03:18:59,219 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 03:18:59,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:18:59,223 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:18:59,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:18:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 03:18:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-01-10 03:18:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:18:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-01-10 03:18:59,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-01-10 03:18:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:18:59,248 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-01-10 03:18:59,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 03:18:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-01-10 03:18:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 03:18:59,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:18:59,249 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:18:59,258 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 03:18:59,456 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 03:18:59,456 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:18:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:18:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-01-10 03:18:59,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:18:59,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880212851] [2022-01-10 03:18:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:18:59,458 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:18:59,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:18:59,459 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 03:18:59,461 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 03:18:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:18:59,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:18:59,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:18:59,543 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 03:18:59,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:18:59,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:18:59,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880212851] [2022-01-10 03:18:59,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880212851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:18:59,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:18:59,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:18:59,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311321642] [2022-01-10 03:18:59,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:18:59,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:18:59,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:18:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:18:59,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:18:59,547 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:18:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:18:59,635 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-01-10 03:18:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:18:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2022-01-10 03:18:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:18:59,637 INFO L225 Difference]: With dead ends: 38 [2022-01-10 03:18:59,637 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 03:18:59,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:18:59,638 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:18:59,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:18:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 03:18:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-01-10 03:18:59,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:18:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-10 03:18:59,645 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-01-10 03:18:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:18:59,646 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-10 03:18:59,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 03:18:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-10 03:18:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 03:18:59,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:18:59,647 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:18:59,653 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 03:18:59,853 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 03:18:59,853 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:18:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:18:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-01-10 03:18:59,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:18:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847033958] [2022-01-10 03:18:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:18:59,855 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:18:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:18:59,856 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 03:18:59,858 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 03:18:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:18:59,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:18:59,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:18:59,926 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 03:18:59,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:18:59,927 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:18:59,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847033958] [2022-01-10 03:18:59,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847033958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:18:59,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:18:59,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:18:59,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105607996] [2022-01-10 03:18:59,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:18:59,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:18:59,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:18:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:18:59,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:18:59,929 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 03:18:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:18:59,941 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-01-10 03:18:59,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:18:59,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-01-10 03:18:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:18:59,942 INFO L225 Difference]: With dead ends: 44 [2022-01-10 03:18:59,942 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 03:18:59,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:18:59,943 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:18:59,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:18:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 03:18:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 03:18:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:18:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-01-10 03:18:59,949 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-01-10 03:18:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:18:59,949 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-01-10 03:18:59,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 03:18:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-01-10 03:18:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 03:18:59,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:18:59,950 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:18:59,961 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 03:19:00,157 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 03:19:00,157 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-01-10 03:19:00,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641014019] [2022-01-10 03:19:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:00,159 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:00,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:00,162 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 03:19:00,167 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 03:19:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:19:00,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:19:00,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:19:00,282 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 03:19:00,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:19:00,282 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:19:00,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641014019] [2022-01-10 03:19:00,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641014019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:19:00,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:19:00,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:19:00,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984837616] [2022-01-10 03:19:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:19:00,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:19:00,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:19:00,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:19:00,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:19:00,284 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 03:19:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:19:00,373 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-01-10 03:19:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:19:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2022-01-10 03:19:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:19:00,374 INFO L225 Difference]: With dead ends: 44 [2022-01-10 03:19:00,374 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 03:19:00,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:19:00,375 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:19:00,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:19:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 03:19:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-01-10 03:19:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 03:19:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 03:19:00,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-01-10 03:19:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:19:00,381 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 03:19:00,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 03:19:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 03:19:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 03:19:00,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:19:00,382 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:00,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:19:00,588 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 03:19:00,588 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-01-10 03:19:00,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:00,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082579492] [2022-01-10 03:19:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:00,590 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:00,592 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 03:19:00,594 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 03:19:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:19:00,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:19:00,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:19:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:19:00,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:19:00,727 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:19:00,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082579492] [2022-01-10 03:19:00,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082579492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:19:00,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:19:00,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:19:00,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495704259] [2022-01-10 03:19:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:19:00,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:19:00,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:19:00,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:19:00,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:19:00,729 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:19:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:19:00,867 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-01-10 03:19:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:19:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-10 03:19:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:19:00,869 INFO L225 Difference]: With dead ends: 63 [2022-01-10 03:19:00,869 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 03:19:00,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:19:00,874 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:19:00,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:19:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 03:19:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-10 03:19:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:19:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-01-10 03:19:00,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2022-01-10 03:19:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:19:00,882 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-01-10 03:19:00,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:19:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-01-10 03:19:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 03:19:00,882 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:19:00,883 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:00,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 03:19:01,094 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 03:19:01,094 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-01-10 03:19:01,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:01,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474928901] [2022-01-10 03:19:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:01,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:01,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:01,097 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 03:19:01,099 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 03:19:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:19:01,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:19:01,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:19:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:19:01,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:19:01,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:19:01,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474928901] [2022-01-10 03:19:01,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474928901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:19:01,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:19:01,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:19:01,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608993776] [2022-01-10 03:19:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:19:01,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:19:01,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:19:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:19:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:19:01,239 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:19:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:19:01,278 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-01-10 03:19:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:19:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-10 03:19:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:19:01,279 INFO L225 Difference]: With dead ends: 68 [2022-01-10 03:19:01,279 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 03:19:01,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:19:01,280 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:19:01,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:19:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 03:19:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-01-10 03:19:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-01-10 03:19:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-01-10 03:19:01,293 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 28 [2022-01-10 03:19:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:19:01,294 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-01-10 03:19:01,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:19:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-01-10 03:19:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 03:19:01,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:19:01,294 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:01,301 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 03:19:01,500 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 03:19:01,501 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:01,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:01,502 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-01-10 03:19:01,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:01,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882953301] [2022-01-10 03:19:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:01,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:01,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:01,503 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 03:19:01,505 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 03:19:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:19:01,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:19:01,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:19:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 03:19:01,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:19:01,664 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:19:01,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882953301] [2022-01-10 03:19:01,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882953301] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:19:01,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:19:01,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:19:01,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157386715] [2022-01-10 03:19:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:19:01,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:19:01,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:19:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:19:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:19:01,665 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:19:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:19:01,759 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-01-10 03:19:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:19:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-10 03:19:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:19:01,761 INFO L225 Difference]: With dead ends: 74 [2022-01-10 03:19:01,761 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 03:19:01,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:19:01,762 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:19:01,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 94 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:19:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 03:19:01,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-01-10 03:19:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-10 03:19:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2022-01-10 03:19:01,768 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 28 [2022-01-10 03:19:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:19:01,768 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2022-01-10 03:19:01,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 03:19:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-01-10 03:19:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 03:19:01,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:19:01,772 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:01,779 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 03:19:01,979 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 03:19:01,979 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1091220578, now seen corresponding path program 1 times [2022-01-10 03:19:01,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846196190] [2022-01-10 03:19:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:01,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:01,981 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 03:19:01,984 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 03:19:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:19:02,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:19:02,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:19:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-10 03:19:02,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:19:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-10 03:19:02,209 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:19:02,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846196190] [2022-01-10 03:19:02,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846196190] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:19:02,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:19:02,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-01-10 03:19:02,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989425210] [2022-01-10 03:19:02,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:19:02,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 03:19:02,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:19:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 03:19:02,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 03:19:02,211 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 03:19:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:19:02,263 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-01-10 03:19:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:19:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 35 [2022-01-10 03:19:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:19:02,266 INFO L225 Difference]: With dead ends: 88 [2022-01-10 03:19:02,266 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 03:19:02,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:19:02,267 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:19:02,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:19:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 03:19:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-01-10 03:19:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-01-10 03:19:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-01-10 03:19:02,273 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 35 [2022-01-10 03:19:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:19:02,273 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-01-10 03:19:02,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 03:19:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-01-10 03:19:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 03:19:02,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:19:02,274 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:02,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 03:19:02,480 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 03:19:02,483 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:02,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1884102282, now seen corresponding path program 1 times [2022-01-10 03:19:02,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:02,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804030295] [2022-01-10 03:19:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:02,484 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:02,485 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 03:19:02,487 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 03:19:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:19:02,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 03:19:02,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:19:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:19:02,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:19:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-01-10 03:19:03,103 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:19:03,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804030295] [2022-01-10 03:19:03,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804030295] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 03:19:03,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 03:19:03,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-01-10 03:19:03,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932070203] [2022-01-10 03:19:03,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:19:03,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 03:19:03,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:19:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 03:19:03,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:19:03,104 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:19:05,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-10 03:19:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:19:05,420 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-01-10 03:19:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:19:05,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-01-10 03:19:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:19:05,421 INFO L225 Difference]: With dead ends: 76 [2022-01-10 03:19:05,421 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 03:19:05,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:19:05,422 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:19:05,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 124 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 03:19:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 03:19:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-01-10 03:19:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 50 states have internal predecessors, (57), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 03:19:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2022-01-10 03:19:05,429 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 38 [2022-01-10 03:19:05,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:19:05,429 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2022-01-10 03:19:05,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 03:19:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-01-10 03:19:05,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 03:19:05,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:19:05,430 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:05,439 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 03:19:05,637 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 03:19:05,637 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:19:05,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:19:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -785132454, now seen corresponding path program 1 times [2022-01-10 03:19:05,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:19:05,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877198171] [2022-01-10 03:19:05,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:19:05,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:19:05,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:19:05,639 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 03:19:05,648 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 03:19:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:19:05,690 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 03:19:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:19:05,748 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 03:19:05,748 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 03:19:05,749 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:19:05,758 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 03:19:05,950 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 03:19:05,953 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:19:05,955 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:19:05,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:19:05 BoogieIcfgContainer [2022-01-10 03:19:05,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:19:05,979 INFO L158 Benchmark]: Toolchain (without parser) took 7671.92ms. Allocated memory was 215.0MB in the beginning and 272.6MB in the end (delta: 57.7MB). Free memory was 158.2MB in the beginning and 198.2MB in the end (delta: -39.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-01-10 03:19:05,979 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory was 174.8MB in the beginning and 174.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:19:05,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.81ms. Allocated memory is still 215.0MB. Free memory was 158.0MB in the beginning and 184.3MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 03:19:05,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 215.0MB. Free memory was 184.3MB in the beginning and 182.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:19:05,979 INFO L158 Benchmark]: Boogie Preprocessor took 29.63ms. Allocated memory is still 215.0MB. Free memory was 182.8MB in the beginning and 181.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:19:05,980 INFO L158 Benchmark]: RCFGBuilder took 343.26ms. Allocated memory is still 215.0MB. Free memory was 181.7MB in the beginning and 171.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 03:19:05,980 INFO L158 Benchmark]: TraceAbstraction took 6954.14ms. Allocated memory was 215.0MB in the beginning and 272.6MB in the end (delta: 57.7MB). Free memory was 170.7MB in the beginning and 198.2MB in the end (delta: -27.5MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. [2022-01-10 03:19:05,981 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.11ms. Allocated memory is still 215.0MB. Free memory was 174.8MB in the beginning and 174.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 305.81ms. Allocated memory is still 215.0MB. Free memory was 158.0MB in the beginning and 184.3MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 215.0MB. Free memory was 184.3MB in the beginning and 182.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.63ms. Allocated memory is still 215.0MB. Free memory was 182.8MB in the beginning and 181.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 343.26ms. Allocated memory is still 215.0MB. Free memory was 181.7MB in the beginning and 171.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6954.14ms. Allocated memory was 215.0MB in the beginning and 272.6MB in the end (delta: 57.7MB). Free memory was 170.7MB in the beginning and 198.2MB in the end (delta: -27.5MB). Peak memory consumption was 31.3MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] unsigned int A, B; [L25] unsigned int r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=2, B=2, counter=0, d=2, p=1, q=0, r=2] [L35] EXPR counter++ VAL [A=2, B=2, counter=1, counter++=0, d=2, p=1, q=0, r=2] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=2, B=2, counter=1, d=2, p=1, q=0, r=2] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=2, B=2, counter=1, d=2, p=1, q=0, r=2] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=2, B=2, counter=1, d=2, p=1, q=0, r=2] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=2, B=2, counter=1, d=4, p=2, q=0, r=2] [L35] EXPR counter++ VAL [A=2, B=2, counter=2, counter++=1, d=4, p=2, q=0, r=2] [L35] COND TRUE counter++<2 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [A=2, B=2, counter=2, d=4, p=2, q=0, r=2] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [A=2, B=2, counter=2, d=4, p=2, q=0, r=2] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=2, B=2, counter=2, d=4, p=2, q=0, r=2] [L39] COND TRUE !(r >= d) VAL [A=2, B=2, counter=2, d=4, p=2, q=0, r=2] [L45] EXPR counter++ VAL [A=2, B=2, counter=3, counter++=2, d=4, p=2, q=0, r=2] [L45] COND FALSE !(counter++<2) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [A=2, B=2, counter=3, d=4, p=2, q=0, r=2] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 935 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 635 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 300 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 SizeOfPredicates, 7 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 215/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 03:19:06,020 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...