/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:06:55,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:06:55,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:06:55,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:06:55,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:06:55,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:06:55,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:06:55,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:06:55,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:06:55,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:06:55,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:06:55,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:06:55,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:06:55,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:06:55,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:06:55,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:06:55,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:06:55,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:06:55,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:06:55,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:06:55,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:06:55,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:06:55,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:06:55,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:06:55,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:06:55,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:06:55,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:06:55,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:06:55,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:06:55,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:06:55,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:06:55,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:06:55,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:06:55,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:06:55,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:06:55,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:06:55,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:06:55,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:06:55,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:06:55,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:06:55,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:06:55,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:06:55,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:06:55,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:06:55,936 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:06:55,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:06:55,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:06:55,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:06:55,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:06:55,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:06:55,937 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:06:55,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:06:55,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:06:55,938 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:06:55,939 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:06:55,939 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:06:55,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:06:55,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:06:55,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:06:55,939 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:06:56,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:06:56,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:06:56,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:06:56,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:06:56,146 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:06:56,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c [2022-01-10 03:06:56,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391ef1743/00983de3c6d64fc582aebc79cff7a917/FLAG16e7ad529 [2022-01-10 03:06:56,583 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:06:56,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c [2022-01-10 03:06:56,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391ef1743/00983de3c6d64fc582aebc79cff7a917/FLAG16e7ad529 [2022-01-10 03:06:56,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391ef1743/00983de3c6d64fc582aebc79cff7a917 [2022-01-10 03:06:56,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:06:56,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:06:56,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:06:56,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:06:56,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:06:56,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4a7806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56, skipping insertion in model container [2022-01-10 03:06:56,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:06:56,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:06:56,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c[489,502] [2022-01-10 03:06:56,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:06:56,803 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:06:56,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound1.c[489,502] [2022-01-10 03:06:56,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:06:56,824 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:06:56,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56 WrapperNode [2022-01-10 03:06:56,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:06:56,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:06:56,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:06:56,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:06:56,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,846 INFO L137 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2022-01-10 03:06:56,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:06:56,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:06:56,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:06:56,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:06:56,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:06:56,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:06:56,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:06:56,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:06:56,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (1/1) ... [2022-01-10 03:06:56,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:06:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:06:56,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:06:56,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:06:56,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:06:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:06:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 03:06:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 03:06:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:06:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:06:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-10 03:06:56,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-10 03:06:56,971 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:06:56,974 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:06:57,175 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:06:57,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:06:57,180 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 03:06:57,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:06:57 BoogieIcfgContainer [2022-01-10 03:06:57,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:06:57,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:06:57,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:06:57,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:06:57,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:06:56" (1/3) ... [2022-01-10 03:06:57,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777ba0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:06:57, skipping insertion in model container [2022-01-10 03:06:57,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:06:56" (2/3) ... [2022-01-10 03:06:57,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777ba0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:06:57, skipping insertion in model container [2022-01-10 03:06:57,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:06:57" (3/3) ... [2022-01-10 03:06:57,187 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound1.c [2022-01-10 03:06:57,190 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:06:57,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:06:57,266 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:06:57,270 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:06:57,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:06:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 03:06:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:06:57,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:57,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:57,286 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:57,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:57,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1165920622, now seen corresponding path program 1 times [2022-01-10 03:06:57,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:57,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905728290] [2022-01-10 03:06:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:57,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:57,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:57,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:57,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:06:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:57,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:06:57,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:06:57,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:06:57,425 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:57,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905728290] [2022-01-10 03:06:57,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905728290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:06:57,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:06:57,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:06:57,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831561597] [2022-01-10 03:06:57,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:57,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:06:57,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:06:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:06:57,456 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:06:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:57,471 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-01-10 03:06:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:06:57,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-01-10 03:06:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:57,477 INFO L225 Difference]: With dead ends: 57 [2022-01-10 03:06:57,477 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 03:06:57,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:06:57,481 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:57,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:06:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 03:06:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-01-10 03:06:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:06:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-01-10 03:06:57,505 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-01-10 03:06:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:57,505 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-01-10 03:06:57,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:06:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-01-10 03:06:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 03:06:57,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:57,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:57,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:57,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:57,719 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:57,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash -542319922, now seen corresponding path program 1 times [2022-01-10 03:06:57,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:57,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160047035] [2022-01-10 03:06:57,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:57,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:57,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:57,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:57,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:06:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:57,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 03:06:57,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:06:57,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:06:57,845 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:57,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160047035] [2022-01-10 03:06:57,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160047035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:06:57,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:06:57,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:06:57,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957565658] [2022-01-10 03:06:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:57,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:06:57,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:06:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:06:57,851 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:06:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:57,874 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-01-10 03:06:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:06:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-01-10 03:06:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:57,875 INFO L225 Difference]: With dead ends: 38 [2022-01-10 03:06:57,875 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 03:06:57,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:06:57,876 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:57,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:06:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 03:06:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 03:06:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 03:06:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-01-10 03:06:57,882 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-01-10 03:06:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:57,883 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-01-10 03:06:57,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:06:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-01-10 03:06:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 03:06:57,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:57,884 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:57,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:58,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:58,085 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -540651626, now seen corresponding path program 1 times [2022-01-10 03:06:58,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:58,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868030879] [2022-01-10 03:06:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:58,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:58,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:58,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:58,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:06:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:58,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:06:58,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:06:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:06:58,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:06:58,280 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:06:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868030879] [2022-01-10 03:06:58,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868030879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:06:58,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:06:58,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:06:58,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062742773] [2022-01-10 03:06:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:06:58,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:06:58,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:06:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:06:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:06:58,282 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:06:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:06:59,380 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-01-10 03:06:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:06:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-01-10 03:06:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:06:59,394 INFO L225 Difference]: With dead ends: 45 [2022-01-10 03:06:59,394 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 03:06:59,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:06:59,395 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:06:59,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 03:06:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 03:06:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-01-10 03:06:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 03:06:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2022-01-10 03:06:59,404 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2022-01-10 03:06:59,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:06:59,404 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2022-01-10 03:06:59,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-10 03:06:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2022-01-10 03:06:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 03:06:59,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:06:59,405 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:06:59,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:06:59,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:06:59,606 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:06:59,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:06:59,607 INFO L85 PathProgramCache]: Analyzing trace with hash -276555716, now seen corresponding path program 1 times [2022-01-10 03:06:59,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:06:59,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868740040] [2022-01-10 03:06:59,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:06:59,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:06:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:06:59,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:06:59,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:06:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:06:59,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 03:06:59,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:07:00,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:00,029 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:00,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868740040] [2022-01-10 03:07:00,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868740040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:00,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:00,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 03:07:00,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88092657] [2022-01-10 03:07:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:00,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 03:07:00,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 03:07:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:07:00,031 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:07:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:01,989 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-01-10 03:07:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:07:02,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-01-10 03:07:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:02,001 INFO L225 Difference]: With dead ends: 49 [2022-01-10 03:07:02,001 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 03:07:02,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:07:02,002 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 37 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:02,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 185 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 03:07:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 03:07:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-01-10 03:07:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-01-10 03:07:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-01-10 03:07:02,010 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 24 [2022-01-10 03:07:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:02,010 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-01-10 03:07:02,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 03:07:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-01-10 03:07:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 03:07:02,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:02,011 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:02,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:07:02,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:02,223 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:02,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1836785898, now seen corresponding path program 1 times [2022-01-10 03:07:02,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:02,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775484393] [2022-01-10 03:07:02,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:02,224 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:02,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:02,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:02,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:07:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:02,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 03:07:02,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 03:07:02,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:02,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:02,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775484393] [2022-01-10 03:07:02,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775484393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:02,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:02,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 03:07:02,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015206491] [2022-01-10 03:07:02,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:02,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 03:07:02,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 03:07:02,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 03:07:02,698 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 03:07:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:04,727 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2022-01-10 03:07:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 03:07:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-01-10 03:07:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:04,730 INFO L225 Difference]: With dead ends: 71 [2022-01-10 03:07:04,731 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 03:07:04,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 03:07:04,732 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:04,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 03:07:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 03:07:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-10 03:07:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 39 states have internal predecessors, (47), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-01-10 03:07:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2022-01-10 03:07:04,742 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 29 [2022-01-10 03:07:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:04,742 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2022-01-10 03:07:04,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 03:07:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2022-01-10 03:07:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 03:07:04,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:04,743 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:04,755 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 03:07:04,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:04,951 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1071030291, now seen corresponding path program 1 times [2022-01-10 03:07:04,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:04,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516015518] [2022-01-10 03:07:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:04,952 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:04,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:04,954 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:04,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:07:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:07:05,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 03:07:05,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:07:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 03:07:05,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:07:05,260 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:07:05,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516015518] [2022-01-10 03:07:05,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516015518] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:07:05,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:07:05,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 03:07:05,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316687723] [2022-01-10 03:07:05,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:07:05,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:07:05,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:07:05,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:07:05,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:07:05,262 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:07:06,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:07:06,651 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2022-01-10 03:07:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:07:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-01-10 03:07:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:07:06,665 INFO L225 Difference]: With dead ends: 83 [2022-01-10 03:07:06,665 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 03:07:06,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 03:07:06,666 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 03:07:06,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 137 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 03:07:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 03:07:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-01-10 03:07:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 45 states have internal predecessors, (50), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-01-10 03:07:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2022-01-10 03:07:06,683 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 35 [2022-01-10 03:07:06,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:07:06,683 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2022-01-10 03:07:06,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-10 03:07:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-01-10 03:07:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 03:07:06,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:07:06,684 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:06,697 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 03:07:06,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:06,896 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:07:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:07:06,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1689492770, now seen corresponding path program 1 times [2022-01-10 03:07:06,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:07:06,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771703236] [2022-01-10 03:07:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:07:06,897 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:07:06,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:07:06,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:07:06,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 03:07:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:07:07,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 03:07:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 03:07:07,343 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 03:07:07,344 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 03:07:07,344 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 03:07:07,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 03:07:07,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:07:07,554 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:07:07,556 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 03:07:07,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:07:07 BoogieIcfgContainer [2022-01-10 03:07:07,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 03:07:07,581 INFO L158 Benchmark]: Toolchain (without parser) took 10967.98ms. Allocated memory was 183.5MB in the beginning and 272.6MB in the end (delta: 89.1MB). Free memory was 132.8MB in the beginning and 208.2MB in the end (delta: -75.4MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-01-10 03:07:07,581 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 03:07:07,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.98ms. Allocated memory is still 183.5MB. Free memory was 132.6MB in the beginning and 154.3MB in the end (delta: -21.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 03:07:07,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.88ms. Allocated memory is still 183.5MB. Free memory was 154.3MB in the beginning and 152.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:07:07,582 INFO L158 Benchmark]: Boogie Preprocessor took 14.92ms. Allocated memory is still 183.5MB. Free memory was 152.7MB in the beginning and 151.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 03:07:07,582 INFO L158 Benchmark]: RCFGBuilder took 319.00ms. Allocated memory is still 183.5MB. Free memory was 151.7MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 03:07:07,583 INFO L158 Benchmark]: TraceAbstraction took 10398.66ms. Allocated memory was 183.5MB in the beginning and 272.6MB in the end (delta: 89.1MB). Free memory was 140.7MB in the beginning and 208.2MB in the end (delta: -67.5MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. [2022-01-10 03:07:07,584 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 183.5MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.98ms. Allocated memory is still 183.5MB. Free memory was 132.6MB in the beginning and 154.3MB in the end (delta: -21.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.88ms. Allocated memory is still 183.5MB. Free memory was 154.3MB in the beginning and 152.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.92ms. Allocated memory is still 183.5MB. Free memory was 152.7MB in the beginning and 151.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 319.00ms. Allocated memory is still 183.5MB. Free memory was 151.7MB in the beginning and 141.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10398.66ms. Allocated memory was 183.5MB in the beginning and 272.6MB in the end (delta: 89.1MB). Free memory was 140.7MB in the beginning and 208.2MB in the end (delta: -67.5MB). Peak memory consumption was 22.6MB. 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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=3] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=3, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=3, b=1, counter=0, p=1, q=0, r=0, s=1, x=3, y=1] [L34] EXPR counter++ VAL [a=3, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=3, y=1] [L34] COND TRUE counter++<1 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L39] COND FALSE !(!(a != b)) VAL [a=3, b=1, counter=1, p=1, q=0, r=0, s=1, x=3, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=2, b=1, counter=1, p=1, q=0, r=-1, s=1, x=3, y=1] [L34] EXPR counter++ VAL [a=2, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=3, y=1] [L34] COND FALSE !(counter++<1) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=2] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=2] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 752 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 531 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 221 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, InterpolantAutomatonStates: 34, 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, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 8 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 52/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 03:07:07,621 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...