/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/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:39:04,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:39:04,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:39:04,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:39:04,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:39:04,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:39:04,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:39:04,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:39:04,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:39:04,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:39:04,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:39:04,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:39:04,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:39:04,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:39:04,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:39:04,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:39:04,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:39:04,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:39:04,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:39:04,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:39:04,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:39:04,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:39:04,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:39:04,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:39:04,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:39:04,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:39:04,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:39:04,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:39:04,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:39:04,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:39:04,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:39:04,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:39:04,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:39:04,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:39:04,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:39:04,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:39:04,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:39:04,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:39:04,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:39:04,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:39:04,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:39:04,940 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 06:39:04,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:39:04,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:39:04,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:39:04,971 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:39:04,971 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:39:04,971 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:39:04,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:39:04,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:39:04,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:39:04,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:39:04,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:39:04,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:39:04,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:39:04,974 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 06:39:05,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:39:05,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:39:05,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:39:05,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:39:05,175 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:39:05,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2022-01-10 06:39:05,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe1baaab/22f5314e665247ae8b7ec685e0cfb581/FLAGe38706d19 [2022-01-10 06:39:05,576 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:39:05,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2022-01-10 06:39:05,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe1baaab/22f5314e665247ae8b7ec685e0cfb581/FLAGe38706d19 [2022-01-10 06:39:05,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fe1baaab/22f5314e665247ae8b7ec685e0cfb581 [2022-01-10 06:39:05,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:39:05,602 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:39:05,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:39:05,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:39:05,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:39:05,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89afcae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05, skipping insertion in model container [2022-01-10 06:39:05,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:39:05,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:39:05,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c[741,754] [2022-01-10 06:39:05,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:39:05,785 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:39:05,793 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c[741,754] [2022-01-10 06:39:05,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:39:05,802 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:39:05,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05 WrapperNode [2022-01-10 06:39:05,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:39:05,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:39:05,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:39:05,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:39:05,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,830 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-01-10 06:39:05,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:39:05,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:39:05,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:39:05,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:39:05,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:39:05,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:39:05,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:39:05,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:39:05,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (1/1) ... [2022-01-10 06:39:05,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:39:05,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:39:05,871 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 06:39:05,878 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 06:39:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:39:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:39:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:39:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:39:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-01-10 06:39:05,897 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-01-10 06:39:05,938 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:39:05,939 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:39:06,005 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:39:06,009 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:39:06,010 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 06:39:06,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:39:06 BoogieIcfgContainer [2022-01-10 06:39:06,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:39:06,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:39:06,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:39:06,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:39:06,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:39:05" (1/3) ... [2022-01-10 06:39:06,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e030c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:39:06, skipping insertion in model container [2022-01-10 06:39:06,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:39:05" (2/3) ... [2022-01-10 06:39:06,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e030c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:39:06, skipping insertion in model container [2022-01-10 06:39:06,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:39:06" (3/3) ... [2022-01-10 06:39:06,016 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2022-01-10 06:39:06,020 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:39:06,020 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:39:06,092 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:39:06,097 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 06:39:06,097 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:39:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:39:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 06:39:06,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:06,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:06,124 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:06,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 795692101, now seen corresponding path program 1 times [2022-01-10 06:39:06,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652601120] [2022-01-10 06:39:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:39:06,153 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:06,179 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 06:39:06,203 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 06:39:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:06,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:39:06,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:06,407 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 06:39:06,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:39:06,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652601120] [2022-01-10 06:39:06,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652601120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:39:06,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:39:06,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:39:06,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953994434] [2022-01-10 06:39:06,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:39:06,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:39:06,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:06,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:39:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:39:06,442 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:39:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:06,506 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-01-10 06:39:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:39:06,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-01-10 06:39:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:06,515 INFO L225 Difference]: With dead ends: 29 [2022-01-10 06:39:06,515 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 06:39:06,517 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 06:39:06,519 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:06,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:39:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 06:39:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-10 06:39:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 06:39:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-10 06:39:06,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-01-10 06:39:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:06,550 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-10 06:39:06,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:39:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-10 06:39:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 06:39:06,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:06,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:06,557 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 06:39:06,755 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 06:39:06,756 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash -360006549, now seen corresponding path program 1 times [2022-01-10 06:39:06,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:06,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52407020] [2022-01-10 06:39:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:39:06,759 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:06,760 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 06:39:06,761 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 06:39:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:06,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:39:06,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:06,815 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 06:39:06,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:39:06,815 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52407020] [2022-01-10 06:39:06,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52407020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:39:06,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:39:06,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:39:06,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925568429] [2022-01-10 06:39:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:39:06,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:39:06,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:39:06,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:39:06,822 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:39:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:06,866 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-01-10 06:39:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:39:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-10 06:39:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:06,868 INFO L225 Difference]: With dead ends: 23 [2022-01-10 06:39:06,868 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 06:39:06,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 06:39:06,869 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:06,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:39:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 06:39:06,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-01-10 06:39:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 06:39:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-10 06:39:06,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2022-01-10 06:39:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:06,880 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-10 06:39:06,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:39:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-10 06:39:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 06:39:06,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:06,885 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:06,911 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 06:39:07,093 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 06:39:07,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1663150085, now seen corresponding path program 1 times [2022-01-10 06:39:07,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:07,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470854775] [2022-01-10 06:39:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:39:07,095 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:07,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:07,096 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 06:39:07,097 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 06:39:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:39:07,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:39:07,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:39:07,483 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:07,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470854775] [2022-01-10 06:39:07,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470854775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:07,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:07,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2022-01-10 06:39:07,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351412255] [2022-01-10 06:39:07,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:07,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 06:39:07,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 06:39:07,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 06:39:07,485 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:39:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:07,587 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-01-10 06:39:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:39:07,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 22 [2022-01-10 06:39:07,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:07,588 INFO L225 Difference]: With dead ends: 27 [2022-01-10 06:39:07,589 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 06:39:07,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:39:07,590 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:07,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 37 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 06:39:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-01-10 06:39:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 06:39:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-01-10 06:39:07,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 22 [2022-01-10 06:39:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:07,595 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-01-10 06:39:07,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:39:07,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-01-10 06:39:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 06:39:07,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:07,596 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:07,605 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 06:39:07,802 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 06:39:07,803 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 17297569, now seen corresponding path program 1 times [2022-01-10 06:39:07,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:07,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497358921] [2022-01-10 06:39:07,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:39:07,804 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:07,805 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 06:39:07,806 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 06:39:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:07,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:39:07,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:39:07,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:39:08,070 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:08,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497358921] [2022-01-10 06:39:08,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497358921] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:08,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:08,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2022-01-10 06:39:08,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518986505] [2022-01-10 06:39:08,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:08,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 06:39:08,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:08,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 06:39:08,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 06:39:08,073 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:39:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:08,155 INFO L93 Difference]: Finished difference Result 45 states and 79 transitions. [2022-01-10 06:39:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:39:08,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2022-01-10 06:39:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:08,159 INFO L225 Difference]: With dead ends: 45 [2022-01-10 06:39:08,160 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 06:39:08,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:39:08,167 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:08,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 58 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 06:39:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-10 06:39:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (19), 7 states have call predecessors, (19), 5 states have call successors, (19) [2022-01-10 06:39:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2022-01-10 06:39:08,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 23 [2022-01-10 06:39:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:08,179 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2022-01-10 06:39:08,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 06:39:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2022-01-10 06:39:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 06:39:08,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:08,180 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:08,188 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 06:39:08,382 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 06:39:08,382 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash -310195131, now seen corresponding path program 2 times [2022-01-10 06:39:08,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:08,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757579627] [2022-01-10 06:39:08,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:08,383 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:08,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:08,384 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 06:39:08,385 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 06:39:08,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:08,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:08,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:39:08,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:39:08,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:39:08,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:08,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757579627] [2022-01-10 06:39:08,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757579627] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:08,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:08,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2022-01-10 06:39:08,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866236075] [2022-01-10 06:39:08,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:08,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:39:08,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:39:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:39:08,898 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-10 06:39:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:09,055 INFO L93 Difference]: Finished difference Result 60 states and 110 transitions. [2022-01-10 06:39:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:39:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2022-01-10 06:39:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:09,058 INFO L225 Difference]: With dead ends: 60 [2022-01-10 06:39:09,058 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 06:39:09,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:39:09,059 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:09,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 06:39:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-01-10 06:39:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-01-10 06:39:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2022-01-10 06:39:09,065 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 34 [2022-01-10 06:39:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:09,065 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-01-10 06:39:09,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 11 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-10 06:39:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-01-10 06:39:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 06:39:09,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:09,066 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:09,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:09,275 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 06:39:09,275 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -441896069, now seen corresponding path program 2 times [2022-01-10 06:39:09,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:09,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435184596] [2022-01-10 06:39:09,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:09,276 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:09,277 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 06:39:09,278 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 06:39:09,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:09,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:09,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:39:09,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 06:39:09,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:39:09,592 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435184596] [2022-01-10 06:39:09,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435184596] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:09,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:09,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2022-01-10 06:39:09,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237731523] [2022-01-10 06:39:09,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:09,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:39:09,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:09,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:39:09,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:39:09,593 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-10 06:39:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:09,694 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2022-01-10 06:39:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:39:09,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 36 [2022-01-10 06:39:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:09,695 INFO L225 Difference]: With dead ends: 67 [2022-01-10 06:39:09,695 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 06:39:09,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:39:09,696 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:09,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 06:39:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-01-10 06:39:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (22), 10 states have call predecessors, (22), 7 states have call successors, (22) [2022-01-10 06:39:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2022-01-10 06:39:09,702 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 36 [2022-01-10 06:39:09,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:09,703 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2022-01-10 06:39:09,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2022-01-10 06:39:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2022-01-10 06:39:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 06:39:09,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:09,705 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:09,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:09,913 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 06:39:09,913 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -104523349, now seen corresponding path program 3 times [2022-01-10 06:39:09,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621817139] [2022-01-10 06:39:09,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:39:09,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:09,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:09,915 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 06:39:09,916 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 06:39:09,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 06:39:09,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:09,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:39:09,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 180 proven. 5 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2022-01-10 06:39:10,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 136 proven. 15 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-01-10 06:39:10,554 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621817139] [2022-01-10 06:39:10,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621817139] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:10,554 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:10,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-01-10 06:39:10,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807235756] [2022-01-10 06:39:10,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:10,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:39:10,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:39:10,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:39:10,556 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-01-10 06:39:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:10,644 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2022-01-10 06:39:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:39:10,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 83 [2022-01-10 06:39:10,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:10,646 INFO L225 Difference]: With dead ends: 66 [2022-01-10 06:39:10,646 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 06:39:10,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:39:10,647 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:10,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 56 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:10,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 06:39:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-10 06:39:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-01-10 06:39:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-01-10 06:39:10,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 83 [2022-01-10 06:39:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:10,650 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-01-10 06:39:10,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 6 states have call successors, (11), 2 states have call predecessors, (11), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-01-10 06:39:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-01-10 06:39:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-10 06:39:10,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:10,652 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:10,660 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 06:39:10,858 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 06:39:10,858 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash 694906923, now seen corresponding path program 4 times [2022-01-10 06:39:10,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:10,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423079502] [2022-01-10 06:39:10,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:39:10,859 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:10,860 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 06:39:10,861 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 06:39:10,898 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:39:10,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:10,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 06:39:10,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 27 proven. 154 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-01-10 06:39:11,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 27 proven. 169 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2022-01-10 06:39:11,481 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:11,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423079502] [2022-01-10 06:39:11,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423079502] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:11,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:11,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2022-01-10 06:39:11,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710625595] [2022-01-10 06:39:11,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:11,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 06:39:11,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:11,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 06:39:11,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-10 06:39:11,482 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 13 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2022-01-10 06:39:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:11,612 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-01-10 06:39:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:39:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 13 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 87 [2022-01-10 06:39:11,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:11,614 INFO L225 Difference]: With dead ends: 72 [2022-01-10 06:39:11,614 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 06:39:11,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:39:11,615 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:11,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 91 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 06:39:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-01-10 06:39:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2022-01-10 06:39:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-01-10 06:39:11,619 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 87 [2022-01-10 06:39:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:11,620 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-01-10 06:39:11,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 13 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2022-01-10 06:39:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-01-10 06:39:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 06:39:11,621 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:11,621 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:11,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:11,841 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 06:39:11,841 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1826158945, now seen corresponding path program 5 times [2022-01-10 06:39:11,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:11,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865228633] [2022-01-10 06:39:11,842 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 06:39:11,842 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:11,843 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 06:39:11,844 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 06:39:11,911 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-01-10 06:39:11,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:11,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 06:39:11,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 318 proven. 265 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-01-10 06:39:12,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 321 proven. 309 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2022-01-10 06:39:14,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:14,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865228633] [2022-01-10 06:39:14,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865228633] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:14,150 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:14,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 23 [2022-01-10 06:39:14,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349236974] [2022-01-10 06:39:14,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:14,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 06:39:14,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 06:39:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-01-10 06:39:14,153 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 23 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 21 states have internal predecessors, (56), 16 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 16 states have call successors, (27) [2022-01-10 06:39:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:14,624 INFO L93 Difference]: Finished difference Result 99 states and 164 transitions. [2022-01-10 06:39:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 06:39:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 21 states have internal predecessors, (56), 16 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 16 states have call successors, (27) Word has length 137 [2022-01-10 06:39:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:14,626 INFO L225 Difference]: With dead ends: 99 [2022-01-10 06:39:14,626 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 06:39:14,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 242 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2022-01-10 06:39:14,627 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:14,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 141 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:39:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 06:39:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-01-10 06:39:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (29), 13 states have call predecessors, (29), 10 states have call successors, (29) [2022-01-10 06:39:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2022-01-10 06:39:14,636 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 137 [2022-01-10 06:39:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:14,636 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2022-01-10 06:39:14,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 21 states have internal predecessors, (56), 16 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 16 states have call successors, (27) [2022-01-10 06:39:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2022-01-10 06:39:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 06:39:14,637 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:14,637 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:14,643 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 06:39:14,843 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 06:39:14,844 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash -999938399, now seen corresponding path program 6 times [2022-01-10 06:39:14,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814323097] [2022-01-10 06:39:14,845 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 06:39:14,845 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:14,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:14,846 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 06:39:14,850 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 06:39:14,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-01-10 06:39:14,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:39:14,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 06:39:14,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 41 proven. 212 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-01-10 06:39:15,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 41 proven. 238 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-01-10 06:39:15,599 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:15,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814323097] [2022-01-10 06:39:15,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814323097] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:15,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:15,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2022-01-10 06:39:15,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348587523] [2022-01-10 06:39:15,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:15,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 06:39:15,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:15,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 06:39:15,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-01-10 06:39:15,601 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2022-01-10 06:39:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:15,785 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-01-10 06:39:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:39:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) Word has length 99 [2022-01-10 06:39:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:15,787 INFO L225 Difference]: With dead ends: 56 [2022-01-10 06:39:15,787 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 06:39:15,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 181 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:39:15,788 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:15,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 126 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:39:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 06:39:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-01-10 06:39:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) [2022-01-10 06:39:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 73 transitions. [2022-01-10 06:39:15,793 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 73 transitions. Word has length 99 [2022-01-10 06:39:15,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:15,793 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 73 transitions. [2022-01-10 06:39:15,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 15 states have internal predecessors, (41), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2022-01-10 06:39:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 73 transitions. [2022-01-10 06:39:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 06:39:15,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:15,794 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:15,801 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 06:39:16,000 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 06:39:16,001 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:16,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1213908091, now seen corresponding path program 7 times [2022-01-10 06:39:16,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:16,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927406739] [2022-01-10 06:39:16,001 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 06:39:16,001 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:16,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:16,002 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:16,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 06:39:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:39:16,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 06:39:16,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:39:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 89 proven. 492 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2022-01-10 06:39:16,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:39:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 89 proven. 532 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2022-01-10 06:39:17,123 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:39:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927406739] [2022-01-10 06:39:17,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927406739] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:39:17,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:39:17,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2022-01-10 06:39:17,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502575223] [2022-01-10 06:39:17,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:39:17,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 06:39:17,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:39:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 06:39:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:39:17,125 INFO L87 Difference]: Start difference. First operand 52 states and 73 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2022-01-10 06:39:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:39:17,371 INFO L93 Difference]: Finished difference Result 120 states and 216 transitions. [2022-01-10 06:39:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:39:17,372 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 162 [2022-01-10 06:39:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:39:17,375 INFO L225 Difference]: With dead ends: 120 [2022-01-10 06:39:17,375 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 06:39:17,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 305 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2022-01-10 06:39:17,376 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:39:17,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 169 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:39:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 06:39:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2022-01-10 06:39:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (33), 15 states have call predecessors, (33), 12 states have call successors, (33) [2022-01-10 06:39:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 85 transitions. [2022-01-10 06:39:17,397 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 85 transitions. Word has length 162 [2022-01-10 06:39:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:39:17,398 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 85 transitions. [2022-01-10 06:39:17,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 17 states have internal predecessors, (46), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2022-01-10 06:39:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 85 transitions. [2022-01-10 06:39:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-01-10 06:39:17,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:39:17,400 INFO L514 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:39:17,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-01-10 06:39:17,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:17,626 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:39:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:39:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash -812944297, now seen corresponding path program 8 times [2022-01-10 06:39:17,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:39:17,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279567556] [2022-01-10 06:39:17,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:39:17,627 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:39:17,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:39:17,628 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:39:17,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:39:17,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:39:17,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 06:39:17,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:39:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:39:17,938 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:39:17,938 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:39:17,939 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:39:17,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:39:18,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:39:18,152 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1] [2022-01-10 06:39:18,154 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:39:18,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:39:18 BoogieIcfgContainer [2022-01-10 06:39:18,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:39:18,219 INFO L158 Benchmark]: Toolchain (without parser) took 12616.80ms. Allocated memory was 204.5MB in the beginning and 272.6MB in the end (delta: 68.2MB). Free memory was 153.8MB in the beginning and 133.8MB in the end (delta: 20.0MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-01-10 06:39:18,219 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory was 170.3MB in the beginning and 170.1MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:39:18,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.49ms. Allocated memory is still 204.5MB. Free memory was 153.7MB in the beginning and 180.4MB in the end (delta: -26.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-01-10 06:39:18,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.41ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 179.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:39:18,220 INFO L158 Benchmark]: Boogie Preprocessor took 16.36ms. Allocated memory is still 204.5MB. Free memory was 178.8MB in the beginning and 178.3MB in the end (delta: 526.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:39:18,220 INFO L158 Benchmark]: RCFGBuilder took 163.56ms. Allocated memory is still 204.5MB. Free memory was 177.8MB in the beginning and 168.9MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 06:39:18,220 INFO L158 Benchmark]: TraceAbstraction took 12206.64ms. Allocated memory was 204.5MB in the beginning and 272.6MB in the end (delta: 68.2MB). Free memory was 168.3MB in the beginning and 133.8MB in the end (delta: 34.6MB). Peak memory consumption was 103.8MB. Max. memory is 8.0GB. [2022-01-10 06:39:18,221 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 204.5MB. Free memory was 170.3MB in the beginning and 170.1MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.49ms. Allocated memory is still 204.5MB. Free memory was 153.7MB in the beginning and 180.4MB in the end (delta: -26.7MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.41ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 179.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.36ms. Allocated memory is still 204.5MB. Free memory was 178.8MB in the beginning and 178.3MB in the end (delta: 526.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 163.56ms. Allocated memory is still 204.5MB. Free memory was 177.8MB in the beginning and 168.9MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 12206.64ms. Allocated memory was 204.5MB in the beginning and 272.6MB in the end (delta: 68.2MB). Free memory was 168.3MB in the beginning and 133.8MB in the end (delta: 34.6MB). Peak memory consumption was 103.8MB. 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] reach_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 12, TraceHistogramMax: 41, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 688 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1707 IncrementalHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 197 mSDtfsCounter, 1707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1414 GetRequests, 1251 SyntacticMatches, 16 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=11, InterpolantAutomatonStates: 99, 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, 11 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 967 NumberOfCodeBlocks, 871 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1367 ConstructedInterpolants, 0 QuantifiedInterpolants, 3462 SizeOfPredicates, 43 NumberOfNonLiveVariables, 972 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 5796/8312 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 06:39:18,244 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...