/usr/bin/java -ea -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:24:37,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:24:37,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:24:37,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:24:37,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:24:37,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:24:37,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:24:37,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:24:37,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:24:37,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:24:37,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:24:37,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:24:37,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:24:37,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:24:37,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:24:37,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:24:37,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:24:37,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:24:37,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:24:37,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:24:37,767 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:24:37,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:24:37,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:24:37,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:24:37,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:24:37,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:24:37,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:24:37,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:24:37,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:24:37,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:24:37,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:24:37,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:24:37,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:24:37,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:24:37,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:24:37,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:24:37,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:24:37,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:24:37,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:24:37,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:24:37,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:24:37,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:24:37,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:24:37,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:24:37,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:24:37,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:24:37,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:24:37,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:24:37,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:24:37,813 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:24:37,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:24:37,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:24:37,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:24:37,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:24:37,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:24:37,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:24:37,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:24:37,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:24:37,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:24:37,817 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:24:37,817 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-15 00:24:38,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:24:38,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:24:38,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:24:38,046 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:24:38,046 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:24:38,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-15 00:24:38,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4759c4705/b18bdae6eaef42728cbc804008bc2160/FLAGb2e6d9663 [2022-04-15 00:24:38,460 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:24:38,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-15 00:24:38,465 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4759c4705/b18bdae6eaef42728cbc804008bc2160/FLAGb2e6d9663 [2022-04-15 00:24:38,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4759c4705/b18bdae6eaef42728cbc804008bc2160 [2022-04-15 00:24:38,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:24:38,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:24:38,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:24:38,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:24:38,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:24:38,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398b779a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38, skipping insertion in model container [2022-04-15 00:24:38,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:24:38,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:24:38,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c[327,340] [2022-04-15 00:24:38,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:24:38,754 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:24:38,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c[327,340] [2022-04-15 00:24:38,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:24:38,782 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:24:38,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38 WrapperNode [2022-04-15 00:24:38,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:24:38,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:24:38,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:24:38,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:24:38,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:24:38,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:24:38,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:24:38,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:24:38,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (1/1) ... [2022-04-15 00:24:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:24:38,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:38,844 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-04-15 00:24:38,865 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-04-15 00:24:38,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:24:38,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:24:38,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:24:38,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:24:38,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:24:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:24:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:24:38,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:24:38,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:24:38,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:24:38,934 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:24:38,936 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:24:39,084 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:24:39,092 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:24:39,092 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:24:39,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:24:39 BoogieIcfgContainer [2022-04-15 00:24:39,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:24:39,100 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:24:39,100 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:24:39,102 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:24:39,105 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:24:39" (1/1) ... [2022-04-15 00:24:39,106 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:24:39,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:24:39 BasicIcfg [2022-04-15 00:24:39,147 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:24:39,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:24:39,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:24:39,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:24:39,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:24:38" (1/4) ... [2022-04-15 00:24:39,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658e7ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:24:39, skipping insertion in model container [2022-04-15 00:24:39,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:38" (2/4) ... [2022-04-15 00:24:39,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658e7ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:24:39, skipping insertion in model container [2022-04-15 00:24:39,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:24:39" (3/4) ... [2022-04-15 00:24:39,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658e7ce8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:24:39, skipping insertion in model container [2022-04-15 00:24:39,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:24:39" (4/4) ... [2022-04-15 00:24:39,153 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-1.cqvasr [2022-04-15 00:24:39,156 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:24:39,156 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:24:39,221 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:24:39,227 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-15 00:24:39,227 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:24:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:24:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:24:39,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:39,252 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:39,252 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-15 00:24:39,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:39,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76310700] [2022-04-15 00:24:39,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:39,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:39,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 00:24:39,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:39,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:39,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:39,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 00:24:39,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:39,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:39,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:39,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21#true} is VALID [2022-04-15 00:24:39,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:24:39,450 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {22#false} is VALID [2022-04-15 00:24:39,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {22#false} is VALID [2022-04-15 00:24:39,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:24:39,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:24:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:39,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:39,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76310700] [2022-04-15 00:24:39,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76310700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:24:39,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:24:39,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:24:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542843889] [2022-04-15 00:24:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:24:39,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:39,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:39,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:39,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:24:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:24:39,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:24:39,510 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:39,591 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 00:24:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:24:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 00:24:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 00:24:39,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 00:24:39,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:39,660 INFO L225 Difference]: With dead ends: 29 [2022-04-15 00:24:39,660 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 00:24:39,663 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:24:39,667 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:39,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:24:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 00:24:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 00:24:39,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:39,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,693 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,693 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:39,695 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 00:24:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 00:24:39,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:39,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:39,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 00:24:39,696 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 00:24:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:39,698 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 00:24:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 00:24:39,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:39,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:39,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:39,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 00:24:39,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 00:24:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:39,705 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 00:24:39,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 00:24:39,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:24:39,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:39,706 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:39,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:24:39,707 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-15 00:24:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164040568] [2022-04-15 00:24:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:39,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-15 00:24:39,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:39,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:39,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:39,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-15 00:24:39,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:39,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:39,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:39,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {115#(= main_~x~0 0)} is VALID [2022-04-15 00:24:39,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-15 00:24:39,795 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {111#false} is VALID [2022-04-15 00:24:39,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {111#false} is VALID [2022-04-15 00:24:39,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-15 00:24:39,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-15 00:24:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:39,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164040568] [2022-04-15 00:24:39,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164040568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:24:39,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:24:39,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:24:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244429767] [2022-04-15 00:24:39,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:24:39,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:39,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:39,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:39,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:24:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:24:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:24:39,816 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:39,861 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:24:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:24:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 00:24:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 00:24:39,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 00:24:39,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:39,893 INFO L225 Difference]: With dead ends: 18 [2022-04-15 00:24:39,893 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 00:24:39,894 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:24:39,895 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:39,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:24:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 00:24:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 00:24:39,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:39,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,900 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,900 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:39,903 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 00:24:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 00:24:39,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:39,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:39,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 00:24:39,904 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 00:24:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:39,907 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 00:24:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 00:24:39,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:39,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:39,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:39,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 00:24:39,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 00:24:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:39,910 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 00:24:39,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 00:24:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:24:39,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:39,912 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:39,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:24:39,912 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-15 00:24:39,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:39,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705655091] [2022-04-15 00:24:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:39,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:40,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:40,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:40,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:40,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {201#(= main_~x~0 0)} is VALID [2022-04-15 00:24:40,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:24:40,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,036 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {197#false} is VALID [2022-04-15 00:24:40,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#false} is VALID [2022-04-15 00:24:40,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:40,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:40,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705655091] [2022-04-15 00:24:40,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705655091] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:24:40,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997340293] [2022-04-15 00:24:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:40,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:40,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:40,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:24:40,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:24:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:40,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 00:24:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:40,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:24:40,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:40,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {222#(= main_~y~0 1)} is VALID [2022-04-15 00:24:40,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= main_~y~0 1)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {226#(= main_~y~0 2)} is VALID [2022-04-15 00:24:40,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(= main_~y~0 2)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {226#(= main_~y~0 2)} is VALID [2022-04-15 00:24:40,199 INFO L272 TraceCheckUtils]: 8: Hoare triple {226#(= main_~y~0 2)} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:24:40,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:24:40,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:40,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:24:40,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:40,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:24:40,360 INFO L272 TraceCheckUtils]: 8: Hoare triple {253#(not (= 64 (mod main_~y~0 4294967296)))} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:24:40,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(not (= 64 (mod main_~y~0 4294967296)))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {253#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 00:24:40,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(not (= (mod (* main_~y~0 2) 4294967296) 64))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {253#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 00:24:40,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {260#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-15 00:24:40,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:40,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:40,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997340293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:24:40,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:24:40,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-15 00:24:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112820070] [2022-04-15 00:24:40,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:24:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:24:40,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:40,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:40,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 00:24:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 00:24:40,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 00:24:40,389 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:40,638 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 00:24:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:24:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:24:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2022-04-15 00:24:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2022-04-15 00:24:40,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 27 transitions. [2022-04-15 00:24:40,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:40,674 INFO L225 Difference]: With dead ends: 25 [2022-04-15 00:24:40,674 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 00:24:40,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-15 00:24:40,676 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:40,676 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:24:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 00:24:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 00:24:40,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:40,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,682 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,682 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:40,684 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:24:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:24:40,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:40,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:40,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 00:24:40,685 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 00:24:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:40,686 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:24:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:24:40,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:40,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:40,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:40,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 00:24:40,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-15 00:24:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:40,688 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 00:24:40,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:24:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:24:40,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:40,689 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:40,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:24:40,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:40,912 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 200712928, now seen corresponding path program 2 times [2022-04-15 00:24:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:40,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186390001] [2022-04-15 00:24:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:41,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-15 00:24:41,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {393#true} {393#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:41,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-15 00:24:41,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {398#(= main_~x~0 0)} is VALID [2022-04-15 00:24:41,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(= main_~x~0 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:24:41,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {400#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:24:41,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {401#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:24:41,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {402#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:24:41,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {394#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {394#false} is VALID [2022-04-15 00:24:41,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {394#false} is VALID [2022-04-15 00:24:41,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:41,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186390001] [2022-04-15 00:24:41,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186390001] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:24:41,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971432920] [2022-04-15 00:24:41,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:24:41,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:41,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:24:41,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:24:41,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:24:41,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:24:41,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 00:24:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:41,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:24:41,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-15 00:24:41,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {422#(= main_~y~0 1)} is VALID [2022-04-15 00:24:41,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= main_~y~0 1)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {426#(= main_~y~0 2)} is VALID [2022-04-15 00:24:41,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(= main_~y~0 2)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {430#(= main_~y~0 4)} is VALID [2022-04-15 00:24:41,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(= main_~y~0 4)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {434#(= main_~y~0 8)} is VALID [2022-04-15 00:24:41,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#(= main_~y~0 8)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {438#(= main_~y~0 16)} is VALID [2022-04-15 00:24:41,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#(= main_~y~0 16)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {438#(= main_~y~0 16)} is VALID [2022-04-15 00:24:41,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {438#(= main_~y~0 16)} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:24:41,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:24:41,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:41,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:24:41,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#(<= 1 __VERIFIER_assert_~cond)} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {394#false} is VALID [2022-04-15 00:24:41,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 |__VERIFIER_assert_#in~cond|)} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:24:41,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {465#(not (= 64 (mod main_~y~0 4294967296)))} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (not (= 64 (mod v_main_~y~0_5 4294967296))) 1 0)) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:24:41,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(not (= 64 (mod main_~y~0 4294967296)))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {465#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 00:24:41,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= (mod (* main_~y~0 2) 4294967296) 64))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {465#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 00:24:41,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(not (= (mod (* main_~y~0 4) 4294967296) 64))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {472#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-15 00:24:41,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(not (= (mod (* main_~y~0 8) 4294967296) 64))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {476#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-15 00:24:41,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {480#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-15 00:24:41,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {484#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} is VALID [2022-04-15 00:24:41,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {393#true} is VALID [2022-04-15 00:24:41,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {393#true} is VALID [2022-04-15 00:24:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:41,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971432920] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:24:41,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:24:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-04-15 00:24:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468805492] [2022-04-15 00:24:41,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:24:41,557 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:24:41,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:41,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:41,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:41,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 00:24:41,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 00:24:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-04-15 00:24:41,585 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:43,132 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 00:24:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 00:24:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:24:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-15 00:24:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-15 00:24:43,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2022-04-15 00:24:45,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:45,146 INFO L225 Difference]: With dead ends: 34 [2022-04-15 00:24:45,146 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 00:24:45,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-04-15 00:24:45,148 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:45,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 00:24:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 00:24:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 00:24:45,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:45,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:45,160 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:45,160 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:45,162 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 00:24:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 00:24:45,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:45,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:45,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 00:24:45,162 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 00:24:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:45,164 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 00:24:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 00:24:45,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:45,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:45,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:45,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 00:24:45,172 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2022-04-15 00:24:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:45,172 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 00:24:45,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 00:24:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:24:45,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:45,173 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:45,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:24:45,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:24:45,384 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash 466685312, now seen corresponding path program 3 times [2022-04-15 00:24:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453189420] [2022-04-15 00:24:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:24:45,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 00:24:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 00:24:45,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 00:24:45,453 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 00:24:45,455 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:24:45,456 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 00:24:45,458 INFO L719 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-15 00:24:45,460 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:24:45,479 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 00:24:45,479 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 00:24:45,479 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 00:24:45,479 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 00:24:45,479 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:24:45,479 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 00:24:45,480 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 00:24:45,480 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 00:24:45,480 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:24:45,483 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:24:45,483 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:24:45,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:24:45 BasicIcfg [2022-04-15 00:24:45,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:24:45,485 INFO L158 Benchmark]: Toolchain (without parser) took 7008.43ms. Allocated memory was 179.3MB in the beginning and 245.4MB in the end (delta: 66.1MB). Free memory was 127.1MB in the beginning and 191.2MB in the end (delta: -64.2MB). Peak memory consumption was 992.1kB. Max. memory is 8.0GB. [2022-04-15 00:24:45,485 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 143.2MB in the beginning and 143.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:24:45,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.08ms. Allocated memory is still 179.3MB. Free memory was 126.8MB in the beginning and 156.7MB in the end (delta: -29.9MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-15 00:24:45,486 INFO L158 Benchmark]: Boogie Preprocessor took 31.24ms. Allocated memory is still 179.3MB. Free memory was 156.7MB in the beginning and 155.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:24:45,486 INFO L158 Benchmark]: RCFGBuilder took 282.64ms. Allocated memory is still 179.3MB. Free memory was 155.1MB in the beginning and 145.1MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 00:24:45,486 INFO L158 Benchmark]: IcfgTransformer took 46.22ms. Allocated memory is still 179.3MB. Free memory was 145.1MB in the beginning and 144.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:24:45,487 INFO L158 Benchmark]: TraceAbstraction took 6336.21ms. Allocated memory was 179.3MB in the beginning and 245.4MB in the end (delta: 66.1MB). Free memory was 143.6MB in the beginning and 191.2MB in the end (delta: -47.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-15 00:24:45,488 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory was 143.2MB in the beginning and 143.1MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.08ms. Allocated memory is still 179.3MB. Free memory was 126.8MB in the beginning and 156.7MB in the end (delta: -29.9MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.24ms. Allocated memory is still 179.3MB. Free memory was 156.7MB in the beginning and 155.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 282.64ms. Allocated memory is still 179.3MB. Free memory was 155.1MB in the beginning and 145.1MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 46.22ms. Allocated memory is still 179.3MB. Free memory was 145.1MB in the beginning and 144.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6336.21ms. Allocated memory was 179.3MB in the beginning and 245.4MB in the end (delta: 66.1MB). Free memory was 143.6MB in the beginning and 191.2MB in the end (delta: -47.7MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L13] unsigned int x = 0; [L14] unsigned int y = 1; VAL [x=0, y=1] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=1, y=2] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=2, y=4] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=3, y=8] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=4, y=16] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=5, y=32] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=6, y=64] [L16] COND FALSE !(x < 6) VAL [x=6, y=64] [L21] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 52 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 2 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/33 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-04-15 00:24:45,506 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...