/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/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:36:24,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:36:24,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:36:24,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:36:24,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:36:24,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:36:24,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:36:24,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:36:24,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:36:24,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:36:24,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:36:24,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:36:24,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:36:24,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:36:24,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:36:24,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:36:24,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:36:24,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:36:24,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:36:24,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:36:24,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:36:24,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:36:24,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:36:24,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:36:24,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:36:24,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:36:24,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:36:24,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:36:24,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:36:24,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:36:24,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:36:24,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:36:24,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:36:24,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:36:24,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:36:24,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:36:24,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:36:24,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:36:24,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:36:24,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:36:24,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:36:24,982 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:36:25,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:36:25,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:36:25,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:36:25,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:36:25,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:36:25,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:36:25,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:36:25,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:36:25,007 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:36:25,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:36:25,008 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:36:25,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:36:25,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:36:25,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:36:25,010 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:36:25,010 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:36:25,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:36:25,011 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:36:25,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:36:25,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:36:25,011 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:36:25,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:36:25,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:36:25,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:36:25,198 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:36:25,198 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:36:25,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2022-01-10 06:36:25,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d84d241/e80e9b955ec34c52a787b17f2e4ec89d/FLAG0566a4b96 [2022-01-10 06:36:25,601 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:36:25,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2022-01-10 06:36:25,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d84d241/e80e9b955ec34c52a787b17f2e4ec89d/FLAG0566a4b96 [2022-01-10 06:36:25,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d84d241/e80e9b955ec34c52a787b17f2e4ec89d [2022-01-10 06:36:25,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:36:25,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:36:25,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:36:25,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:36:25,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:36:25,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179b90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25, skipping insertion in model container [2022-01-10 06:36:25,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:36:25,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:36:25,758 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/Fibonacci04.c[780,793] [2022-01-10 06:36:25,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:36:25,777 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:36:25,786 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/Fibonacci04.c[780,793] [2022-01-10 06:36:25,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:36:25,795 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:36:25,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25 WrapperNode [2022-01-10 06:36:25,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:36:25,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:36:25,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:36:25,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:36:25,802 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:36:25" (1/1) ... [2022-01-10 06:36:25,806 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:36:25" (1/1) ... [2022-01-10 06:36:25,816 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-01-10 06:36:25,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:36:25,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:36:25,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:36:25,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:36:25,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:36:25,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:36:25,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:36:25,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:36:25,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (1/1) ... [2022-01-10 06:36:25,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:36:25,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:36:25,851 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:36:25,857 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:36:25,879 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-01-10 06:36:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-01-10 06:36:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:36:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:36:25,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:36:25,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:36:25,919 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:36:25,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:36:26,000 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:36:26,007 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:36:26,008 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 06:36:26,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:36:26 BoogieIcfgContainer [2022-01-10 06:36:26,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:36:26,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:36:26,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:36:26,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:36:26,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:36:25" (1/3) ... [2022-01-10 06:36:26,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fea9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:36:26, skipping insertion in model container [2022-01-10 06:36:26,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:36:25" (2/3) ... [2022-01-10 06:36:26,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fea9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:36:26, skipping insertion in model container [2022-01-10 06:36:26,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:36:26" (3/3) ... [2022-01-10 06:36:26,029 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2022-01-10 06:36:26,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:36:26,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:36:26,100 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:36:26,107 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:36:26,107 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:36:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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:36:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 06:36:26,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:26,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:36:26,130 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash 377493052, now seen corresponding path program 1 times [2022-01-10 06:36:26,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:26,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229467787] [2022-01-10 06:36:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:36:26,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:26,142 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:36:26,143 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:36:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:36:26,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:36:26,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:26,254 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:36:26,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:36:26,254 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:26,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229467787] [2022-01-10 06:36:26,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229467787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:36:26,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:36:26,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:36:26,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149418882] [2022-01-10 06:36:26,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:36:26,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:36:26,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:36:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:36:26,281 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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, 5 states have (on average 1.6) 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:36:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:26,344 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-01-10 06:36:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:36:26,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) 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:36:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:26,350 INFO L225 Difference]: With dead ends: 30 [2022-01-10 06:36:26,350 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 06:36:26,352 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:36:26,355 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:26,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 38 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:36:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 06:36:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-10 06:36:26,377 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:36:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-10 06:36:26,378 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-01-10 06:36:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:26,379 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-10 06:36:26,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) 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:36:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-10 06:36:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 06:36:26,380 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:26,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:36:26,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:36:26,585 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:36:26,586 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -458075208, now seen corresponding path program 1 times [2022-01-10 06:36:26,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:26,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256940024] [2022-01-10 06:36:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:36:26,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:26,588 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:36:26,590 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:36:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:36:26,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:36:26,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:26,665 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:36:26,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:36:26,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256940024] [2022-01-10 06:36:26,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256940024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:36:26,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:36:26,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:36:26,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495919922] [2022-01-10 06:36:26,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:36:26,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:36:26,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:36:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:36:26,668 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) 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:36:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:26,721 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-01-10 06:36:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:36:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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:36:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:26,723 INFO L225 Difference]: With dead ends: 23 [2022-01-10 06:36:26,723 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 06:36:26,723 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:36:26,724 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:26,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 32 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:36:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 06:36:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-01-10 06:36:26,728 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:36:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-10 06:36:26,728 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2022-01-10 06:36:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:26,729 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-10 06:36:26,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) 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:36:26,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-10 06:36:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 06:36:26,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:26,730 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:36:26,736 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:36:26,935 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:36:26,936 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:26,937 INFO L85 PathProgramCache]: Analyzing trace with hash -355642372, now seen corresponding path program 1 times [2022-01-10 06:36:26,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:26,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919485436] [2022-01-10 06:36:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:36:26,937 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:26,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:26,939 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:36:26,940 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:36:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:36:26,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:36:26,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:36:27,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:36:27,055 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:27,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919485436] [2022-01-10 06:36:27,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919485436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:36:27,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:36:27,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:36:27,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731790807] [2022-01-10 06:36:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:36:27,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:36:27,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:36:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:36:27,057 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:36:27,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:27,122 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-01-10 06:36:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:36:27,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2022-01-10 06:36:27,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:27,123 INFO L225 Difference]: With dead ends: 33 [2022-01-10 06:36:27,124 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 06:36:27,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 06:36:27,129 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:27,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:36:27,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 06:36:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 06:36:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:36:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 06:36:27,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2022-01-10 06:36:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:27,143 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 06:36:27,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:36:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 06:36:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 06:36:27,145 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:27,145 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:36:27,153 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:36:27,351 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:36:27,351 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1118758198, now seen corresponding path program 1 times [2022-01-10 06:36:27,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:27,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525374679] [2022-01-10 06:36:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:36:27,353 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:27,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:27,354 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:36:27,355 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:36:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:36:27,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:36:27,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:27,477 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:36:27,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:36:27,664 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:36:27,664 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525374679] [2022-01-10 06:36:27,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525374679] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:36:27,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:36:27,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2022-01-10 06:36:27,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439821091] [2022-01-10 06:36:27,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:36:27,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:36:27,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:36:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:36:27,666 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 06:36:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:27,800 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2022-01-10 06:36:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:36:27,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2022-01-10 06:36:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:27,802 INFO L225 Difference]: With dead ends: 51 [2022-01-10 06:36:27,802 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 06:36:27,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-01-10 06:36:27,803 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:27,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 57 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:36:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 06:36:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 06:36:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (20), 7 states have call predecessors, (20), 6 states have call successors, (20) [2022-01-10 06:36:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-01-10 06:36:27,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 23 [2022-01-10 06:36:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:27,819 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2022-01-10 06:36:27,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 06:36:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2022-01-10 06:36:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-10 06:36:27,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:27,822 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:36:27,831 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:36:28,027 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:36:28,027 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:28,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:28,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1196440174, now seen corresponding path program 2 times [2022-01-10 06:36:28,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:28,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876747771] [2022-01-10 06:36:28,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:36:28,028 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:28,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:28,030 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:36:28,032 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:36:28,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:36:28,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:36:28,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 06:36:28,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 06:36:28,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:36:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 06:36:28,613 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:28,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876747771] [2022-01-10 06:36:28,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876747771] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:36:28,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:36:28,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 14 [2022-01-10 06:36:28,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498440874] [2022-01-10 06:36:28,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:36:28,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 06:36:28,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 06:36:28,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:36:28,621 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-01-10 06:36:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:28,863 INFO L93 Difference]: Finished difference Result 80 states and 162 transitions. [2022-01-10 06:36:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:36:28,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) Word has length 47 [2022-01-10 06:36:28,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:28,864 INFO L225 Difference]: With dead ends: 80 [2022-01-10 06:36:28,864 INFO L226 Difference]: Without dead ends: 49 [2022-01-10 06:36:28,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-01-10 06:36:28,866 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:28,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 100 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:36:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-10 06:36:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-01-10 06:36:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (25), 12 states have call predecessors, (25), 9 states have call successors, (25) [2022-01-10 06:36:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2022-01-10 06:36:28,873 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 47 [2022-01-10 06:36:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:28,874 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2022-01-10 06:36:28,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2022-01-10 06:36:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2022-01-10 06:36:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 06:36:28,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:28,875 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:36:28,884 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:36:29,082 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:36:29,084 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:29,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 666577820, now seen corresponding path program 3 times [2022-01-10 06:36:29,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:29,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479336671] [2022-01-10 06:36:29,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:36:29,085 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:29,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:29,086 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:36:29,091 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:36:29,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 06:36:29,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:36:29,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:36:29,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2022-01-10 06:36:29,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:36:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 53 proven. 23 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-01-10 06:36:29,499 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:29,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479336671] [2022-01-10 06:36:29,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479336671] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:36:29,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:36:29,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2022-01-10 06:36:29,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097595051] [2022-01-10 06:36:29,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:36:29,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 06:36:29,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:29,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 06:36:29,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 06:36:29,501 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 06:36:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:29,594 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2022-01-10 06:36:29,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:36:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-01-10 06:36:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:29,597 INFO L225 Difference]: With dead ends: 79 [2022-01-10 06:36:29,597 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 06:36:29,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-01-10 06:36:29,598 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:29,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 50 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:36:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 06:36:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-01-10 06:36:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 10 states have call successors, (10), 4 states have call predecessors, (10), 9 states have return successors, (37), 14 states have call predecessors, (37), 10 states have call successors, (37) [2022-01-10 06:36:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2022-01-10 06:36:29,606 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 73 [2022-01-10 06:36:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:29,607 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2022-01-10 06:36:29,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-10 06:36:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2022-01-10 06:36:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 06:36:29,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:29,610 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:36:29,618 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:36:29,810 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:36:29,811 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 984338690, now seen corresponding path program 4 times [2022-01-10 06:36:29,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:29,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517808837] [2022-01-10 06:36:29,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 06:36:29,812 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:29,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:29,813 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:36:29,814 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:36:29,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 06:36:29,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:36:29,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 06:36:29,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:36:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 184 proven. 373 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-01-10 06:36:30,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:36:31,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 197 proven. 400 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2022-01-10 06:36:31,023 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:36:31,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517808837] [2022-01-10 06:36:31,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517808837] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:36:31,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:36:31,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 19 [2022-01-10 06:36:31,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812701813] [2022-01-10 06:36:31,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:36:31,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:36:31,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:36:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:36:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-01-10 06:36:31,025 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 15 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (23), 9 states have call predecessors, (23), 15 states have call successors, (23) [2022-01-10 06:36:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:36:31,359 INFO L93 Difference]: Finished difference Result 128 states and 275 transitions. [2022-01-10 06:36:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 06:36:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 15 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (23), 9 states have call predecessors, (23), 15 states have call successors, (23) Word has length 137 [2022-01-10 06:36:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:36:31,361 INFO L225 Difference]: With dead ends: 128 [2022-01-10 06:36:31,362 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 06:36:31,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 249 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=759, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 06:36:31,363 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 94 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:36:31,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 110 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:36:31,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 06:36:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-01-10 06:36:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 10 states have call successors, (10), 6 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:36:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2022-01-10 06:36:31,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 137 [2022-01-10 06:36:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:36:31,371 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2022-01-10 06:36:31,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 18 states have internal predecessors, (55), 15 states have call successors, (18), 1 states have call predecessors, (18), 9 states have return successors, (23), 9 states have call predecessors, (23), 15 states have call successors, (23) [2022-01-10 06:36:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2022-01-10 06:36:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 06:36:31,373 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:36:31,373 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:36:31,380 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:36:31,580 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:36:31,580 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:36:31,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:36:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1088532606, now seen corresponding path program 5 times [2022-01-10 06:36:31,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:36:31,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854804441] [2022-01-10 06:36:31,581 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 06:36:31,581 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:36:31,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:36:31,583 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:36:31,588 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:36:31,648 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-01-10 06:36:31,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 06:36:31,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:36:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:36:31,711 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:36:31,711 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:36:31,712 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:36:31,747 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:36:31,913 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:36:31,916 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-01-10 06:36:31,919 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:36:31,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:36:31 BoogieIcfgContainer [2022-01-10 06:36:31,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:36:31,968 INFO L158 Benchmark]: Toolchain (without parser) took 6348.08ms. Allocated memory was 198.2MB in the beginning and 252.7MB in the end (delta: 54.5MB). Free memory was 141.8MB in the beginning and 149.8MB in the end (delta: -8.0MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2022-01-10 06:36:31,968 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:36:31,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.90ms. Allocated memory is still 198.2MB. Free memory was 141.5MB in the beginning and 169.0MB in the end (delta: -27.4MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-01-10 06:36:31,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.51ms. Allocated memory is still 198.2MB. Free memory was 169.0MB in the beginning and 167.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:36:31,969 INFO L158 Benchmark]: Boogie Preprocessor took 11.63ms. Allocated memory is still 198.2MB. Free memory was 167.8MB in the beginning and 166.9MB in the end (delta: 945.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:36:31,969 INFO L158 Benchmark]: RCFGBuilder took 180.58ms. Allocated memory is still 198.2MB. Free memory was 166.9MB in the beginning and 157.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 06:36:31,969 INFO L158 Benchmark]: TraceAbstraction took 5955.98ms. Allocated memory was 198.2MB in the beginning and 252.7MB in the end (delta: 54.5MB). Free memory was 156.9MB in the beginning and 149.8MB in the end (delta: 7.1MB). Peak memory consumption was 62.7MB. Max. memory is 8.0GB. [2022-01-10 06:36:31,970 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 198.2MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.90ms. Allocated memory is still 198.2MB. Free memory was 141.5MB in the beginning and 169.0MB in the end (delta: -27.4MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.51ms. Allocated memory is still 198.2MB. Free memory was 169.0MB in the beginning and 167.8MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.63ms. Allocated memory is still 198.2MB. Free memory was 167.8MB in the beginning and 166.9MB in the end (delta: 945.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 180.58ms. Allocated memory is still 198.2MB. Free memory was 166.9MB in the beginning and 157.4MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5955.98ms. Allocated memory was 198.2MB in the beginning and 252.7MB in the end (delta: 54.5MB). Free memory was 156.9MB in the beginning and 149.8MB in the end (delta: 7.1MB). Peak memory consumption was 62.7MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 111 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 630 GetRequests, 537 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, InterpolantAutomatonStates: 66, 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, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 422 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 1536 SizeOfPredicates, 22 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 2083/3014 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:36:31,996 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...