/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:24:48,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:24:48,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:24:48,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:24:48,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:24:48,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:24:48,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:24:48,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:24:48,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:24:48,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:24:48,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:24:48,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:24:48,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:24:48,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:24:48,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:24:48,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:24:48,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:24:48,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:24:48,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:24:48,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:24:48,345 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:24:48,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:24:48,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:24:48,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:24:48,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:24:48,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:24:48,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:24:48,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:24:48,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:24:48,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:24:48,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:24:48,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:24:48,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:24:48,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:24:48,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:24:48,356 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:24:48,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:24:48,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:24:48,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:24:48,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:24:48,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:24:48,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:24:48,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:24:48,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:24:48,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:24:48,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:24:48,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:24:48,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:24:48,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:24:48,392 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:24:48,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:24:48,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:24:48,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:24:48,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:24:48,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:24:48,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:24:48,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:24:48,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:24:48,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:24:48,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:24:48,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:24:48,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:24:48,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:24:48,396 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:24:48,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:24:48,397 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:24:48,397 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:24:48,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:24:48,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:24:48,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:24:48,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:24:48,629 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:24:48,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-15 00:24:48,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505bbbd7e/b22ecc05089849fab9c52c837d68f8b1/FLAGcfd3036ec [2022-04-15 00:24:49,025 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:24:49,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2022-04-15 00:24:49,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505bbbd7e/b22ecc05089849fab9c52c837d68f8b1/FLAGcfd3036ec [2022-04-15 00:24:49,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/505bbbd7e/b22ecc05089849fab9c52c837d68f8b1 [2022-04-15 00:24:49,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:24:49,446 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:24:49,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:24:49,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:24:49,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:24:49,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7e1b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49, skipping insertion in model container [2022-04-15 00:24:49,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:24:49,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:24:49,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-15 00:24:49,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:24:49,614 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:24:49,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2022-04-15 00:24:49,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:24:49,640 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:24:49,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49 WrapperNode [2022-04-15 00:24:49,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:24:49,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:24:49,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:24:49,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:24:49,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:24:49,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:24:49,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:24:49,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:24:49,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:24:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:49,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:24:49,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:24:49,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:24:49,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:24:49,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:24:49,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:24:49,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:24:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:24:49,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:24:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:24:49,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:24:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:24:49,786 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:24:49,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:24:49,934 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:24:49,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:24:49,940 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:24:49,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:24:49 BoogieIcfgContainer [2022-04-15 00:24:49,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:24:49,942 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:24:49,942 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:24:49,944 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:24:49,947 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:24:49" (1/1) ... [2022-04-15 00:24:49,949 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:24:49,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:24:49 BasicIcfg [2022-04-15 00:24:49,987 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:24:49,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:24:49,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:24:49,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:24:49,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:24:49" (1/4) ... [2022-04-15 00:24:49,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560c2d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:24:49, skipping insertion in model container [2022-04-15 00:24:49,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:24:49" (2/4) ... [2022-04-15 00:24:49,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560c2d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:24:49, skipping insertion in model container [2022-04-15 00:24:49,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:24:49" (3/4) ... [2022-04-15 00:24:49,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560c2d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:24:49, skipping insertion in model container [2022-04-15 00:24:49,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:24:49" (4/4) ... [2022-04-15 00:24:49,994 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.cqvasr [2022-04-15 00:24:49,998 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:24:49,998 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:24:50,032 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:24:50,037 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:24:50,037 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:24:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:24:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:24:50,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:50,055 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:50,056 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1690616289, now seen corresponding path program 1 times [2022-04-15 00:24:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:50,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466305091] [2022-04-15 00:24:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 00:24:50,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:50,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:50,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:50,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {21#true} is VALID [2022-04-15 00:24:50,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:50,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:50,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21#true} is VALID [2022-04-15 00:24:50,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {21#true} is VALID [2022-04-15 00:24:50,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} [45] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:24:50,271 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {22#false} is VALID [2022-04-15 00:24:50,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {22#false} is VALID [2022-04-15 00:24:50,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:24:50,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#false} is VALID [2022-04-15 00:24:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:50,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466305091] [2022-04-15 00:24:50,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466305091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:24:50,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:24:50,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:24:50,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045807459] [2022-04-15 00:24:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:24:50,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:50,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:50,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:50,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:24:50,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:50,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:24:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:24:50,332 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:50,415 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 00:24:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:24:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 00:24:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 00:24:50,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 00:24:50,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:50,486 INFO L225 Difference]: With dead ends: 29 [2022-04-15 00:24:50,487 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 00:24:50,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:24:50,494 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:50,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:24:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 00:24:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 00:24:50,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:50,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,524 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,525 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:50,531 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 00:24:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 00:24:50,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:50,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:50,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 00:24:50,532 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 00:24:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:50,535 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 00:24:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 00:24:50,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:50,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:50,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:50,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 00:24:50,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 00:24:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:50,541 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 00:24:50,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 00:24:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 00:24:50,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:50,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:50,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:24:50,551 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1689692768, now seen corresponding path program 1 times [2022-04-15 00:24:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:50,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263011515] [2022-04-15 00:24:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-15 00:24:50,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:50,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:50,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:50,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {110#true} is VALID [2022-04-15 00:24:50,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:50,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:50,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-04-15 00:24:50,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {115#(= main_~x~0 0)} is VALID [2022-04-15 00:24:50,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-15 00:24:50,676 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {111#false} is VALID [2022-04-15 00:24:50,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {111#false} is VALID [2022-04-15 00:24:50,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-15 00:24:50,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-04-15 00:24:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:50,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263011515] [2022-04-15 00:24:50,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263011515] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:24:50,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:24:50,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:24:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869625840] [2022-04-15 00:24:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:24:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:50,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:50,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:50,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:24:50,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:24:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:24:50,695 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:50,743 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:24:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 00:24:50,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 00:24:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 00:24:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 00:24:50,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 00:24:50,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:50,773 INFO L225 Difference]: With dead ends: 18 [2022-04-15 00:24:50,773 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 00:24:50,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 00:24:50,775 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:50,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 00:24:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 00:24:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 00:24:50,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:50,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,779 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,779 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:50,780 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 00:24:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 00:24:50,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:50,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:50,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 00:24:50,781 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 00:24:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:50,782 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 00:24:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 00:24:50,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:50,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:50,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:50,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 00:24:50,784 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 00:24:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:50,785 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 00:24:50,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 00:24:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 00:24:50,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:50,786 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:50,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:24:50,786 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -814146699, now seen corresponding path program 1 times [2022-04-15 00:24:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:50,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780565895] [2022-04-15 00:24:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:50,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:50,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:50,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:50,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:50,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:50,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:50,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:50,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {201#(= main_~x~0 0)} is VALID [2022-04-15 00:24:50,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:24:50,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:50,870 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {197#false} is VALID [2022-04-15 00:24:50,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#false} is VALID [2022-04-15 00:24:50,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:50,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:50,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:50,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780565895] [2022-04-15 00:24:50,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780565895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:24:50,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059803182] [2022-04-15 00:24:50,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:50,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:50,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:50,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:24:50,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:24:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 00:24:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:50,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:24:51,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:51,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {201#(= main_~x~0 0)} is VALID [2022-04-15 00:24:51,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= main_~x~0 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {225#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 00:24:51,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {225#(= (+ (- 1) main_~x~0) 0)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:51,010 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {197#false} is VALID [2022-04-15 00:24:51,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#false} is VALID [2022-04-15 00:24:51,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:51,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:51,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:24:51,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:51,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:51,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {197#false} is VALID [2022-04-15 00:24:51,127 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {197#false} is VALID [2022-04-15 00:24:51,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(< (mod main_~x~0 4294967296) 6)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {197#false} is VALID [2022-04-15 00:24:51,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#(< (mod (+ main_~x~0 1) 4294967296) 6)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {253#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-15 00:24:51,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {257#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-15 00:24:51,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {196#true} is VALID [2022-04-15 00:24:51,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#true} is VALID [2022-04-15 00:24:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:51,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059803182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:24:51,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:24:51,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 00:24:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074318340] [2022-04-15 00:24:51,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:24:51,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:24:51,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:51,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:51,168 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-15 00:24:51,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:24:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:24:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:24:51,170 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:24:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:53,486 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 00:24:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:24:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 00:24:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-15 00:24:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-04-15 00:24:53,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 23 transitions. [2022-04-15 00:24:53,521 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-15 00:24:53,522 INFO L225 Difference]: With dead ends: 21 [2022-04-15 00:24:53,522 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 00:24:53,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:24:53,523 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:53,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 00:24:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 00:24:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 00:24:53,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:53,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,533 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,533 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:53,534 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:24:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:24:53,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:53,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:53,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 00:24:53,535 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 00:24:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:53,536 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 00:24:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:24:53,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:53,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:53,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:53,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 00:24:53,537 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-15 00:24:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:53,538 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 00:24:53,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 00:24:53,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 00:24:53,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:53,538 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:53,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:24:53,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:53,748 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 200712928, now seen corresponding path program 2 times [2022-04-15 00:24:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153173895] [2022-04-15 00:24:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:53,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-15 00:24:53,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:53,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:53,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:53,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-15 00:24:53,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:53,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:53,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:53,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {384#(= main_~x~0 0)} is VALID [2022-04-15 00:24:53,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~x~0 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:24:53,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:24:53,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:24:53,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {388#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:24:53,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:53,901 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {380#false} is VALID [2022-04-15 00:24:53,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {380#false} is VALID [2022-04-15 00:24:53,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:53,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:53,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153173895] [2022-04-15 00:24:53,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153173895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:24:53,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978803033] [2022-04-15 00:24:53,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:24:53,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:53,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:53,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:24:53,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:24:53,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 00:24:53,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:24:53,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 00:24:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:53,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:24:54,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-15 00:24:54,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {384#(= main_~x~0 0)} is VALID [2022-04-15 00:24:54,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= main_~x~0 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 00:24:54,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 00:24:54,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 00:24:54,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {387#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 00:24:54,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:54,251 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {380#false} is VALID [2022-04-15 00:24:54,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {380#false} is VALID [2022-04-15 00:24:54,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:54,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:54,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:24:54,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {380#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:54,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#false} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:54,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#false} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {380#false} is VALID [2022-04-15 00:24:54,417 INFO L272 TraceCheckUtils]: 11: Hoare triple {380#false} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {380#false} is VALID [2022-04-15 00:24:54,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {448#(< (mod main_~x~0 4294967296) 6)} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {380#false} is VALID [2022-04-15 00:24:54,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(< (mod (+ main_~x~0 1) 4294967296) 6)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {448#(< (mod main_~x~0 4294967296) 6)} is VALID [2022-04-15 00:24:54,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(< (mod (+ main_~x~0 2) 4294967296) 6)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {452#(< (mod (+ main_~x~0 1) 4294967296) 6)} is VALID [2022-04-15 00:24:54,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#(< (mod (+ main_~x~0 3) 4294967296) 6)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {456#(< (mod (+ main_~x~0 2) 4294967296) 6)} is VALID [2022-04-15 00:24:54,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(< (mod (+ main_~x~0 4) 4294967296) 6)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {460#(< (mod (+ main_~x~0 3) 4294967296) 6)} is VALID [2022-04-15 00:24:54,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {464#(< (mod (+ main_~x~0 4) 4294967296) 6)} is VALID [2022-04-15 00:24:54,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {379#true} is VALID [2022-04-15 00:24:54,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {379#true} is VALID [2022-04-15 00:24:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:54,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978803033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:24:54,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:24:54,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 00:24:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205013061] [2022-04-15 00:24:54,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:24:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:24:54,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:24:54,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:54,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:54,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:24:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:24:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:24:54,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:24:54,469 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:56,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 00:24:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:56,927 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 00:24:56,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:24:56,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 00:24:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:24:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-15 00:24:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2022-04-15 00:24:56,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2022-04-15 00:24:56,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:24:56,956 INFO L225 Difference]: With dead ends: 23 [2022-04-15 00:24:56,956 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 00:24:56,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-04-15 00:24:56,958 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:24:56,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 00:24:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 00:24:56,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 00:24:56,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:24:56,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 00:24:56,967 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 00:24:56,968 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 00:24:56,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:56,969 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:24:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:24:56,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:56,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:56,970 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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 18 states. [2022-04-15 00:24:56,970 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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 18 states. [2022-04-15 00:24:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:24:56,971 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 00:24:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:24:56,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:24:56,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:24:56,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:24:56,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:24:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-15 00:24:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 00:24:56,973 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-15 00:24:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:24:56,973 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 00:24:56,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:24:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 00:24:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 00:24:56,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:24:56,974 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:24:56,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 00:24:57,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 00:24:57,196 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:24:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:24:57,196 INFO L85 PathProgramCache]: Analyzing trace with hash 466685312, now seen corresponding path program 3 times [2022-04-15 00:24:57,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:24:57,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909202291] [2022-04-15 00:24:57,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:24:57,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:24:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:24:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:24:57,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {602#true} is VALID [2022-04-15 00:24:57,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#true} is VALID [2022-04-15 00:24:57,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {602#true} {602#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#true} is VALID [2022-04-15 00:24:57,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {602#true} [39] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:24:57,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [41] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= (select |v_#length_1| 2) 18) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {602#true} is VALID [2022-04-15 00:24:57,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#true} [44] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#true} is VALID [2022-04-15 00:24:57,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} [56] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#true} is VALID [2022-04-15 00:24:57,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {602#true} [40] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#true} is VALID [2022-04-15 00:24:57,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {602#true} [43] mainENTRY-->L16-2: Formula: (and (= v_main_~x~0_3 0) (= v_main_~y~0_4 1)) InVars {} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {607#(= (+ (- 1) main_~y~0) 0)} is VALID [2022-04-15 00:24:57,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#(= (+ (- 1) main_~y~0) 0)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {608#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} is VALID [2022-04-15 00:24:57,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(<= (* (div (+ (* 44739243 main_~y~0) 178956969) 134217728) 134217728) (+ (* 44739243 main_~y~0) 44739242))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {609#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} is VALID [2022-04-15 00:24:57,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(<= (+ (* 89478485 main_~y~0) (* (div (+ (* (- 89478485) main_~y~0) 357913939) 268435456) 268435456)) 89478484)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {610#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} is VALID [2022-04-15 00:24:57,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#(<= (* (div (+ 715827879 (* main_~y~0 178956971)) 536870912) 536870912) (+ (* main_~y~0 178956971) 178956968))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {611#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} is VALID [2022-04-15 00:24:58,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(<= (+ (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824)) (* main_~y~0 357913941)) 357913936)} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {612#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} is VALID [2022-04-15 00:24:58,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {612#(<= (* (div (+ 2863311519 (* 715827883 main_~y~0)) 2147483648) 2147483648) (+ (* 715827883 main_~y~0) 715827872))} [47] L16-2-->L16-2: Formula: (and (= v_main_~y~0_1 (* v_main_~y~0_2 2)) (< (mod v_main_~x~0_2 4294967296) 6) (= v_main_~x~0_1 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-15 00:24:58,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} [46] L16-2-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} is VALID [2022-04-15 00:24:58,141 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(not (= main_~y~0 (+ (* 4294967296 (div (+ main_~y~0 (* (- 3) (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~y~0 4294967296) 4294967296) (* 3 (div (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 3)))))} [48] L16-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (let ((.cse0 (mod (mod (mod v_main_~y~0_5 4294967296) 3) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {614#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:24:58,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {614#(not (= |__VERIFIER_assert_#in~cond| 0))} [50] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {615#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:24:58,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(not (= __VERIFIER_assert_~cond 0))} [51] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {603#false} is VALID [2022-04-15 00:24:58,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#false} [53] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#false} is VALID [2022-04-15 00:24:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:24:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:24:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909202291] [2022-04-15 00:24:58,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909202291] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:24:58,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173970905] [2022-04-15 00:24:58,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 00:24:58,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:24:58,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:24:58,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:24:58,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process