/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/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:23:37,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:23:37,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:23:37,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:23:37,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:23:37,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:23:37,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:23:37,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:23:37,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:23:37,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:23:37,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:23:37,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:23:37,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:23:37,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:23:37,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:23:37,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:23:37,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:23:37,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:23:37,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:23:37,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:23:37,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:23:37,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:23:37,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:23:37,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:23:37,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:23:37,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:23:37,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:23:37,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:23:37,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:23:37,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:23:37,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:23:37,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:23:37,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:23:37,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:23:37,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:23:37,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:23:37,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:23:37,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:23:37,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:23:37,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:23:37,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:23:37,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:23:37,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:23:37,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:23:37,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:23:37,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:23:37,729 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:23:37,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:23:37,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:23:37,730 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:23:37,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:23:37,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:23:37,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:23:37,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:23:37,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:23:37,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:23:37,733 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:23:37,733 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-27 21:23:37,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:23:37,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:23:37,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:23:37,929 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:23:37,930 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:23:37,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2022-04-27 21:23:37,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d433fca/352e0dad283841faba483b4c679e0e1d/FLAG109b5a233 [2022-04-27 21:23:38,271 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:23:38,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2022-04-27 21:23:38,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d433fca/352e0dad283841faba483b4c679e0e1d/FLAG109b5a233 [2022-04-27 21:23:38,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1d433fca/352e0dad283841faba483b4c679e0e1d [2022-04-27 21:23:38,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:23:38,295 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:23:38,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:23:38,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:23:38,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:23:38,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c10c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38, skipping insertion in model container [2022-04-27 21:23:38,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:23:38,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:23:38,445 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/phases_2-2.c[459,472] [2022-04-27 21:23:38,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:23:38,459 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:23:38,477 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/phases_2-2.c[459,472] [2022-04-27 21:23:38,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:23:38,489 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:23:38,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38 WrapperNode [2022-04-27 21:23:38,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:23:38,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:23:38,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:23:38,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:23:38,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:23:38,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:23:38,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:23:38,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:23:38,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:23:38,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:23:38,529 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-27 21:23:38,546 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-27 21:23:38,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:23:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:23:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:23:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:23:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:23:38,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:23:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:23:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:23:38,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:23:38,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:23:38,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:23:38,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:23:38,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:23:38,616 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:23:38,617 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:23:38,732 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:23:38,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:23:38,743 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:23:38,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:23:38 BoogieIcfgContainer [2022-04-27 21:23:38,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:23:38,744 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:23:38,744 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:23:38,745 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:23:38,752 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:23:38" (1/1) ... [2022-04-27 21:23:38,754 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:23:38,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:23:38 BasicIcfg [2022-04-27 21:23:38,780 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:23:38,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:23:38,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:23:38,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:23:38,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:23:38" (1/4) ... [2022-04-27 21:23:38,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:23:38, skipping insertion in model container [2022-04-27 21:23:38,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:23:38" (2/4) ... [2022-04-27 21:23:38,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:23:38, skipping insertion in model container [2022-04-27 21:23:38,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:23:38" (3/4) ... [2022-04-27 21:23:38,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:23:38, skipping insertion in model container [2022-04-27 21:23:38,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:23:38" (4/4) ... [2022-04-27 21:23:38,784 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_2-2.cqvasr [2022-04-27 21:23:38,793 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:23:38,793 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:23:38,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:23:38,826 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@531facdb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@292b3748 [2022-04-27 21:23:38,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:23:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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-27 21:23:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:23:38,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:23:38,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:23:38,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:23:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:23:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -515753987, now seen corresponding path program 1 times [2022-04-27 21:23:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:23:38,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110233708] [2022-04-27 21:23:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:23:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:23:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:39,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {23#true} is VALID [2022-04-27 21:23:39,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:23:39,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:23:39,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:23:39,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {23#true} is VALID [2022-04-27 21:23:39,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:23:39,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:23:39,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:23:39,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [61] mainENTRY-->L21: Formula: (and (= v_main_~x~0_4 1) (= v_main_~y~0_4 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {23#true} is VALID [2022-04-27 21:23:39,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [64] L21-->L24-2: Formula: (< 0 (mod v_main_~y~0_8 4294967296)) InVars {main_~y~0=v_main_~y~0_8} OutVars{main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-27 21:23:39,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [66] L24-2-->L23-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:23:39,014 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [69] L23-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {24#false} is VALID [2022-04-27 21:23:39,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [72] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-27 21:23:39,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [73] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:23:39,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [75] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-27 21:23:39,015 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-27 21:23:39,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:23:39,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110233708] [2022-04-27 21:23:39,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110233708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:23:39,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:23:39,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:23:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832369568] [2022-04-27 21:23:39,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:23:39,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 21:23:39,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:23:39,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 21:23:39,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:39,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:23:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:23:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:23:39,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:23:39,055 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 21:23:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:39,126 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-27 21:23:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:23:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-27 21:23:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 21:23:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 21:23:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 21:23:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-04-27 21:23:39,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-04-27 21:23:39,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:39,186 INFO L225 Difference]: With dead ends: 31 [2022-04-27 21:23:39,186 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 21:23:39,188 INFO L412 NwaCegarLoop]: 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-27 21:23:39,191 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 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-27 21:23:39,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:23:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 21:23:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 21:23:39,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:39,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-27 21:23:39,210 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-27 21:23:39,210 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-27 21:23:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:39,212 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 21:23:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:23:39,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:39,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:39,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-27 21:23:39,213 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 14 states. [2022-04-27 21:23:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:39,215 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 21:23:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:23:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:39,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:39,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:39,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-27 21:23:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 21:23:39,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-04-27 21:23:39,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:39,218 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 21:23:39,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-27 21:23:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 21:23:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:23:39,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:23:39,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:23:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:23:39,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:23:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:23:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash -514830466, now seen corresponding path program 1 times [2022-04-27 21:23:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:23:39,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570807341] [2022-04-27 21:23:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:39,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:23:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:39,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:23:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:39,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {120#true} is VALID [2022-04-27 21:23:39,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:23:39,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:23:39,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:23:39,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {120#true} is VALID [2022-04-27 21:23:39,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:23:39,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:23:39,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-27 21:23:39,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [61] mainENTRY-->L21: Formula: (and (= v_main_~x~0_4 1) (= v_main_~y~0_4 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {125#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 21:23:39,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(= (+ (- 1) main_~x~0) 0)} [64] L21-->L24-2: Formula: (< 0 (mod v_main_~y~0_8 4294967296)) InVars {main_~y~0=v_main_~y~0_8} OutVars{main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] {126#(and (= (+ (- 1) main_~x~0) 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 21:23:39,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(and (= (+ (- 1) main_~x~0) 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [67] L24-2-->L23-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~y~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {127#(and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div main_~y~0 4294967296) 4294967296) main_~x~0)) (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-27 21:23:39,380 INFO L272 TraceCheckUtils]: 8: Hoare triple {127#(and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div main_~y~0 4294967296) 4294967296) main_~x~0)) (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} [69] L23-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {128#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:23:39,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {128#(not (= |__VERIFIER_assert_#in~cond| 0))} [72] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {129#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:23:39,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#(not (= __VERIFIER_assert_~cond 0))} [73] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-27 21:23:39,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {121#false} [75] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-27 21:23:39,381 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-27 21:23:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:23:39,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570807341] [2022-04-27 21:23:39,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570807341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:23:39,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:23:39,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:23:39,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179240475] [2022-04-27 21:23:39,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:23:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-27 21:23:39,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:23:39,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-27 21:23:39,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:39,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:23:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:23:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:23:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:23:39,394 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-27 21:23:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:39,590 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 21:23:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:23:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-27 21:23:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-27 21:23:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-27 21:23:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-27 21:23:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-27 21:23:39,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-27 21:23:39,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:39,617 INFO L225 Difference]: With dead ends: 21 [2022-04-27 21:23:39,617 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 21:23:39,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:23:39,618 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:23:39,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:23:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 21:23:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 21:23:39,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:39,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 21:23:39,622 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 21:23:39,623 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 21:23:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:39,624 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 21:23:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 21:23:39,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:39,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:39,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 21:23:39,625 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 21:23:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:39,626 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 21:23:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 21:23:39,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:39,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:39,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:39,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-27 21:23:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-27 21:23:39,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-27 21:23:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:39,628 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-27 21:23:39,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-27 21:23:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 21:23:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 21:23:39,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:23:39,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:23:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:23:39,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:23:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:23:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 109185883, now seen corresponding path program 1 times [2022-04-27 21:23:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:23:39,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215569243] [2022-04-27 21:23:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:23:39,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:23:39,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694040970] [2022-04-27 21:23:39,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:39,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:23:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:23:39,655 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-27 21:23:39,659 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-27 21:23:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:39,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 21:23:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:39,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:23:40,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {230#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {230#true} is VALID [2022-04-27 21:23:40,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} [61] mainENTRY-->L21: Formula: (and (= v_main_~x~0_4 1) (= v_main_~y~0_4 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {250#(= main_~x~0 1)} is VALID [2022-04-27 21:23:40,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {250#(= main_~x~0 1)} [64] L21-->L24-2: Formula: (< 0 (mod v_main_~y~0_8 4294967296)) InVars {main_~y~0=v_main_~y~0_8} OutVars{main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] {250#(= main_~x~0 1)} is VALID [2022-04-27 21:23:40,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(= main_~x~0 1)} [68] L24-2-->L24: Formula: (< (mod v_main_~x~0_3 4294967296) (mod v_main_~y~0_3 4294967296)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {257#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 21:23:40,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} [71] L24-->L24-2: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_8 1)) (not (let ((.cse0 (mod v_main_~x~0_8 4294967296))) (< .cse0 (mod (div (mod v_main_~y~0_6 4294967296) .cse0) 4294967296))))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_6} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {261#(and (= (+ (- 1) main_~x~0) 1) (< (mod (+ main_~x~0 4294967295) 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 21:23:40,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(and (= (+ (- 1) main_~x~0) 1) (< (mod (+ main_~x~0 4294967295) 4294967296) (mod main_~y~0 4294967296)))} [67] L24-2-->L23-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~y~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {265#(and (= (+ (- 1) main_~x~0) 1) (< (mod (+ main_~x~0 4294967295) 4294967296) (mod main_~y~0 4294967296)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 21:23:40,225 INFO L272 TraceCheckUtils]: 10: Hoare triple {265#(and (= (+ (- 1) main_~x~0) 1) (< (mod (+ main_~x~0 4294967295) 4294967296) (mod main_~y~0 4294967296)) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))))} [69] L23-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:23:40,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:23:40,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= 1 __VERIFIER_assert_~cond)} [73] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {231#false} is VALID [2022-04-27 21:23:40,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#false} [75] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#false} is VALID [2022-04-27 21:23:40,233 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-27 21:23:40,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:23:40,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#false} [75] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#false} is VALID [2022-04-27 21:23:40,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= 1 __VERIFIER_assert_~cond)} [73] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {231#false} is VALID [2022-04-27 21:23:40,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#(<= 1 |__VERIFIER_assert_#in~cond|)} [72] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:23:40,904 INFO L272 TraceCheckUtils]: 10: Hoare triple {289#(= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} [69] L23-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:23:40,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(or (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} [67] L24-2-->L23-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~y~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {289#(= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 21:23:40,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#(or (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~y~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} [71] L24-->L24-2: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_8 1)) (not (let ((.cse0 (mod v_main_~x~0_8 4294967296))) (< .cse0 (mod (div (mod v_main_~y~0_6 4294967296) .cse0) 4294967296))))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_6} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {293#(or (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 21:23:40,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#true} [68] L24-2-->L24: Formula: (< (mod v_main_~x~0_3 4294967296) (mod v_main_~y~0_3 4294967296)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {297#(or (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296)) (= (mod main_~y~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 21:23:40,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#true} [64] L21-->L24-2: Formula: (< 0 (mod v_main_~y~0_8 4294967296)) InVars {main_~y~0=v_main_~y~0_8} OutVars{main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {230#true} [61] mainENTRY-->L21: Formula: (and (= v_main_~x~0_4 1) (= v_main_~y~0_4 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {230#true} is VALID [2022-04-27 21:23:40,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {230#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {230#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {230#true} is VALID [2022-04-27 21:23:40,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {230#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#true} is VALID [2022-04-27 21:23:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:23:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:23:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215569243] [2022-04-27 21:23:40,912 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:23:40,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694040970] [2022-04-27 21:23:40,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694040970] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 21:23:40,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 21:23:40,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-27 21:23:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717985759] [2022-04-27 21:23:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:23:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 14 [2022-04-27 21:23:40,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:23:40,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-27 21:23:40,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:40,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:23:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:23:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:23:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:23:40,924 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-27 21:23:44,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 21:23:47,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 21:23:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:47,154 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 21:23:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:23:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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 14 [2022-04-27 21:23:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-27 21:23:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-27 21:23:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-27 21:23:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-27 21:23:47,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-27 21:23:47,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:47,189 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:23:47,189 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 21:23:47,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:23:47,190 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:23:47,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-27 21:23:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 21:23:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 21:23:47,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:47,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 21:23:47,194 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 21:23:47,194 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 21:23:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:47,195 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:23:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:23:47,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:47,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:47,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-27 21:23:47,195 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 17 states. [2022-04-27 21:23:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:47,196 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 21:23:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:23:47,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:47,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:47,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:47,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-27 21:23:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 21:23:47,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-04-27 21:23:47,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:47,198 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 21:23:47,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 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-27 21:23:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 21:23:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:23:47,198 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:23:47,198 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:23:47,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:23:47,414 WARN L477 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-27 21:23:47,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:23:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:23:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1535153319, now seen corresponding path program 1 times [2022-04-27 21:23:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:23:47,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925855664] [2022-04-27 21:23:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:23:47,427 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 21:23:47,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341116134] [2022-04-27 21:23:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:23:47,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:23:47,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:23:47,438 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-27 21:23:47,439 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-27 21:23:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:47,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 21:23:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:47,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:23:47,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {421#true} [57] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#true} is VALID [2022-04-27 21:23:47,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} [59] 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|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {421#true} is VALID [2022-04-27 21:23:47,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {421#true} [62] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#true} is VALID [2022-04-27 21:23:47,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {421#true} {421#true} [78] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#true} is VALID [2022-04-27 21:23:47,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {421#true} [58] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#true} is VALID [2022-04-27 21:23:47,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {421#true} [61] mainENTRY-->L21: Formula: (and (= v_main_~x~0_4 1) (= v_main_~y~0_4 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~y~0] {441#(= main_~x~0 1)} is VALID [2022-04-27 21:23:47,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {441#(= main_~x~0 1)} [64] L21-->L24-2: Formula: (< 0 (mod v_main_~y~0_8 4294967296)) InVars {main_~y~0=v_main_~y~0_8} OutVars{main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] {441#(= main_~x~0 1)} is VALID [2022-04-27 21:23:47,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {441#(= main_~x~0 1)} [68] L24-2-->L24: Formula: (< (mod v_main_~x~0_3 4294967296) (mod v_main_~y~0_3 4294967296)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {448#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 21:23:47,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {448#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} [71] L24-->L24-2: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_8 1)) (not (let ((.cse0 (mod v_main_~x~0_8 4294967296))) (< .cse0 (mod (div (mod v_main_~y~0_6 4294967296) .cse0) 4294967296))))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_6} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_7} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {422#false} is VALID [2022-04-27 21:23:47,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#false} [68] L24-2-->L24: Formula: (< (mod v_main_~x~0_3 4294967296) (mod v_main_~y~0_3 4294967296)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {422#false} is VALID [2022-04-27 21:23:47,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#false} [70] L24-->L24-2: Formula: (and (let ((.cse0 (mod v_main_~x~0_6 4294967296))) (< .cse0 (mod (div (mod v_main_~y~0_5 4294967296) .cse0) 4294967296))) (= v_main_~x~0_5 (* v_main_~x~0_6 v_main_~x~0_6))) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~x~0] {422#false} is VALID [2022-04-27 21:23:47,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} [67] L24-2-->L23-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~y~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {422#false} is VALID [2022-04-27 21:23:47,549 INFO L272 TraceCheckUtils]: 12: Hoare triple {422#false} [69] L23-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~y~0_9 4294967296) (mod v_main_~x~0_9 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {422#false} is VALID [2022-04-27 21:23:47,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} [72] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {422#false} is VALID [2022-04-27 21:23:47,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#false} [73] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {422#false} is VALID [2022-04-27 21:23:47,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#false} [75] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#false} is VALID [2022-04-27 21:23:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 21:23:47,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 21:23:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:23:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925855664] [2022-04-27 21:23:47,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 21:23:47,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341116134] [2022-04-27 21:23:47,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341116134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:23:47,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:23:47,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:23:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567168377] [2022-04-27 21:23:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:23:47,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-04-27 21:23:47,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:23:47,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-27 21:23:47,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:47,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:23:47,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:23:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:23:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:23:47,564 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-27 21:23:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:47,599 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 21:23:47,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:23:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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 16 [2022-04-27 21:23:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-27 21:23:47,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 21:23:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-27 21:23:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2022-04-27 21:23:47,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2022-04-27 21:23:47,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:47,617 INFO L225 Difference]: With dead ends: 18 [2022-04-27 21:23:47,617 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:23:47,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:23:47,618 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:23:47,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:23:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:23:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:23:47,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:47,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:23:47,619 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:23:47,619 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:23:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:47,620 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:23:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:23:47,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:47,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:47,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:23:47,620 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:23:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:47,620 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:23:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:23:47,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:47,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:47,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:47,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:23:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:23:47,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-27 21:23:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:47,621 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:23:47,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-27 21:23:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:23:47,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:47,623 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:23:47,657 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-27 21:23:47,839 WARN L477 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-27 21:23:47,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:23:47,888 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:23:47,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:23:47,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:23:47,888 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:23:47,888 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:23:47,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:23:47,888 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:23:47,888 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 17 32) the Hoare annotation is: true [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 32) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L895 garLoopResultBuilder]: At program point L24-2(lines 23 29) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)) [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 32) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 29) the Hoare annotation is: (= (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)) [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 28) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 15) the Hoare annotation is: true [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 13) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 15) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-04-27 21:23:47,889 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 15) no Hoare annotation was computed. [2022-04-27 21:23:47,895 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 21:23:47,896 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:23:47,899 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:23:47,900 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:23:47,901 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:23:47,901 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 21:23:47,901 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 21:23:47,902 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 21:23:47,902 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:23:47,902 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:23:47,902 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:23:47,902 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:23:47,902 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:23:47,902 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:23:47,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:23:47 BasicIcfg [2022-04-27 21:23:47,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:23:47,910 INFO L158 Benchmark]: Toolchain (without parser) took 9614.50ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 175.5MB in the beginning and 154.1MB in the end (delta: 21.4MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2022-04-27 21:23:47,911 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:23:47,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.36ms. Allocated memory is still 198.2MB. Free memory was 175.2MB in the beginning and 172.4MB in the end (delta: 2.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-27 21:23:47,911 INFO L158 Benchmark]: Boogie Preprocessor took 17.19ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 170.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:23:47,911 INFO L158 Benchmark]: RCFGBuilder took 236.19ms. Allocated memory is still 198.2MB. Free memory was 170.8MB in the beginning and 160.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:23:47,911 INFO L158 Benchmark]: IcfgTransformer took 35.30ms. Allocated memory is still 198.2MB. Free memory was 160.0MB in the beginning and 158.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:23:47,912 INFO L158 Benchmark]: TraceAbstraction took 9128.67ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 157.9MB in the beginning and 154.1MB in the end (delta: 3.8MB). Peak memory consumption was 44.9MB. Max. memory is 8.0GB. [2022-04-27 21:23:47,912 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.09ms. Allocated memory is still 198.2MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.36ms. Allocated memory is still 198.2MB. Free memory was 175.2MB in the beginning and 172.4MB in the end (delta: 2.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.19ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 170.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 236.19ms. Allocated memory is still 198.2MB. Free memory was 170.8MB in the beginning and 160.0MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 35.30ms. Allocated memory is still 198.2MB. Free memory was 160.0MB in the beginning and 158.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 9128.67ms. Allocated memory was 198.2MB in the beginning and 238.0MB in the end (delta: 39.8MB). Free memory was 157.9MB in the beginning and 154.1MB in the end (delta: 3.8MB). Peak memory consumption was 44.9MB. 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 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 49 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 31 HoareAnnotationTreeSize, 10 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 50 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 2 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5/6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: x == 1 && y / 4294967296 * 4294967296 + 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-27 21:23:47,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...