/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/loops-crafted-1/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 23:17:59,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 23:17:59,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 23:17:59,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 23:17:59,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 23:17:59,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 23:17:59,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 23:17:59,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 23:17:59,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 23:17:59,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 23:17:59,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 23:17:59,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 23:17:59,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 23:17:59,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 23:17:59,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 23:17:59,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 23:17:59,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 23:17:59,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 23:17:59,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 23:17:59,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 23:17:59,542 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 23:17:59,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 23:17:59,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 23:17:59,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 23:17:59,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 23:17:59,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 23:17:59,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 23:17:59,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 23:17:59,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 23:17:59,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 23:17:59,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 23:17:59,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 23:17:59,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 23:17:59,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 23:17:59,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 23:17:59,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 23:17:59,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 23:17:59,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 23:17:59,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 23:17:59,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 23:17:59,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 23:17:59,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 23:17:59,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 23:17:59,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 23:17:59,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 23:17:59,590 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 23:17:59,590 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 23:17:59,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 23:17:59,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 23:17:59,592 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 23:17:59,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 23:17:59,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 23:17:59,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 23:17:59,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 23:17:59,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 23:17:59,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 23:17:59,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:17:59,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 23:17:59,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 23:17:59,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 23:17:59,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 23:17:59,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 23:17:59,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 23:17:59,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 23:17:59,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 23:17:59,597 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 23:17:59,597 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-07 23:17:59,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 23:17:59,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 23:17:59,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 23:17:59,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 23:17:59,848 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 23:17:59,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-07 23:17:59,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f388f829a/f75238a232ec4ce8bf976d1fef2a72a5/FLAGf8b362764 [2022-04-07 23:18:00,262 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 23:18:00,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-07 23:18:00,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f388f829a/f75238a232ec4ce8bf976d1fef2a72a5/FLAGf8b362764 [2022-04-07 23:18:00,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f388f829a/f75238a232ec4ce8bf976d1fef2a72a5 [2022-04-07 23:18:00,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 23:18:00,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 23:18:00,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 23:18:00,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 23:18:00,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 23:18:00,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:00,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226ea69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00, skipping insertion in model container [2022-04-07 23:18:00,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:00,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 23:18:00,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 23:18:00,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-07 23:18:00,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:18:00,930 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 23:18:00,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c[403,416] [2022-04-07 23:18:00,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 23:18:00,974 INFO L208 MainTranslator]: Completed translation [2022-04-07 23:18:00,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00 WrapperNode [2022-04-07 23:18:00,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 23:18:00,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 23:18:00,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 23:18:00,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 23:18:00,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:00,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:00,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:00,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:01,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:01,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:01,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:01,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 23:18:01,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 23:18:01,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 23:18:01,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 23:18:01,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (1/1) ... [2022-04-07 23:18:01,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 23:18:01,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:18:01,056 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-07 23:18:01,072 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-07 23:18:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 23:18:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 23:18:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 23:18:01,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 23:18:01,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 23:18:01,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 23:18:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 23:18:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 23:18:01,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 23:18:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 23:18:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 23:18:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 23:18:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 23:18:01,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 23:18:01,165 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 23:18:01,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 23:18:03,489 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 23:18:03,495 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 23:18:03,496 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 23:18:03,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:18:03 BoogieIcfgContainer [2022-04-07 23:18:03,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 23:18:03,498 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 23:18:03,498 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 23:18:03,499 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 23:18:03,503 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:18:03" (1/1) ... [2022-04-07 23:18:03,505 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 23:18:03,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:18:03 BasicIcfg [2022-04-07 23:18:03,540 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 23:18:03,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 23:18:03,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 23:18:03,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 23:18:03,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 11:18:00" (1/4) ... [2022-04-07 23:18:03,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc01090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:18:03, skipping insertion in model container [2022-04-07 23:18:03,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 11:18:00" (2/4) ... [2022-04-07 23:18:03,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc01090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 11:18:03, skipping insertion in model container [2022-04-07 23:18:03,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 11:18:03" (3/4) ... [2022-04-07 23:18:03,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc01090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:18:03, skipping insertion in model container [2022-04-07 23:18:03,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 11:18:03" (4/4) ... [2022-04-07 23:18:03,546 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.cqvasr [2022-04-07 23:18:03,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 23:18:03,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 23:18:03,605 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 23:18:03,615 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-07 23:18:03,616 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 23:18:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-07 23:18:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:18:03,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:18:03,640 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:18:03,640 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:18:03,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:18:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2028912826, now seen corresponding path program 1 times [2022-04-07 23:18:03,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:18:03,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799521058] [2022-04-07 23:18:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:18:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:18:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:03,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-07 23:18:03,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:18:03,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:18:03,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:18:03,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {27#true} is VALID [2022-04-07 23:18:03,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:18:03,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:18:03,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:18:03,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {27#true} is VALID [2022-04-07 23:18:03,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-07 23:18:03,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} [78] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 23:18:03,906 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {28#false} is VALID [2022-04-07 23:18:03,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [85] __VERIFIER_assertENTRY-->L9: 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] {28#false} is VALID [2022-04-07 23:18:03,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [89] L9-->L10: 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[] {28#false} is VALID [2022-04-07 23:18:03,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-07 23:18:03,909 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-07 23:18:03,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:18:03,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799521058] [2022-04-07 23:18:03,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799521058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:18:03,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:18:03,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 23:18:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176604303] [2022-04-07 23:18:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:18:03,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:18:03,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:18:03,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:03,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:03,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 23:18:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:18:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 23:18:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 23:18:03,977 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:06,302 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-07 23:18:06,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 23:18:06,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:18:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:18:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-07 23:18:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-04-07 23:18:06,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-04-07 23:18:06,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:06,408 INFO L225 Difference]: With dead ends: 36 [2022-04-07 23:18:06,408 INFO L226 Difference]: Without dead ends: 17 [2022-04-07 23:18:06,411 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-07 23:18:06,414 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 23:18:06,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 23:18:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-07 23:18:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-07 23:18:06,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:18:06,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 23:18:06,441 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 23:18:06,441 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 23:18:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:06,444 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-07 23:18:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-07 23:18:06,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:06,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:06,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-07 23:18:06,448 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-07 23:18:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:06,453 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-07 23:18:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-07 23:18:06,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:06,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:06,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:18:06,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:18:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-07 23:18:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-07 23:18:06,458 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-07 23:18:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:18:06,458 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-07 23:18:06,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-07 23:18:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 23:18:06,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:18:06,459 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:18:06,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 23:18:06,460 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:18:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:18:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2027989305, now seen corresponding path program 1 times [2022-04-07 23:18:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:18:06,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781829259] [2022-04-07 23:18:06,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:18:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:06,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:18:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:06,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {138#true} is VALID [2022-04-07 23:18:06,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {138#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 23:18:06,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138#true} {138#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 23:18:06,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {138#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {146#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:18:06,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {138#true} is VALID [2022-04-07 23:18:06,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 23:18:06,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138#true} {138#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 23:18:06,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {138#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {138#true} is VALID [2022-04-07 23:18:06,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {138#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {143#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:06,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {143#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {143#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:06,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {143#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {143#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:06,813 INFO L272 TraceCheckUtils]: 8: Hoare triple {143#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {144#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:18:06,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {144#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L9: 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] {145#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:18:06,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {145#(not (= __VERIFIER_assert_~cond 0))} [89] L9-->L10: 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[] {139#false} is VALID [2022-04-07 23:18:06,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {139#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {139#false} is VALID [2022-04-07 23:18:06,815 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-07 23:18:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:18:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781829259] [2022-04-07 23:18:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781829259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 23:18:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 23:18:06,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 23:18:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570522358] [2022-04-07 23:18:06,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:18:06,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:18:06,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:18:06,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:06,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:06,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:18:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:18:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:18:06,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 23:18:06,832 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:11,209 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-07 23:18:13,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:18:15,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:18:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:15,743 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-07 23:18:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:18:15,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 23:18:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:18:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 23:18:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 23:18:15,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-07 23:18:15,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:15,803 INFO L225 Difference]: With dead ends: 32 [2022-04-07 23:18:15,804 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 23:18:15,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 23:18:15,805 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:18:15,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 32 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-07 23:18:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 23:18:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 23:18:15,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:18:15,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-07 23:18:15,810 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-07 23:18:15,810 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-07 23:18:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:15,812 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-07 23:18:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-07 23:18:15,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:15,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:15,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 19 states. [2022-04-07 23:18:15,813 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 19 states. [2022-04-07 23:18:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:15,814 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-07 23:18:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-07 23:18:15,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:15,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:15,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:18:15,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:18:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-07 23:18:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-07 23:18:15,819 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-07 23:18:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:18:15,820 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-07 23:18:15,821 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-07 23:18:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 23:18:15,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:18:15,823 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:18:15,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 23:18:15,823 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:18:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:18:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash -169964717, now seen corresponding path program 1 times [2022-04-07 23:18:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:18:15,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046046301] [2022-04-07 23:18:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:18:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:18:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:16,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {265#true} is VALID [2022-04-07 23:18:16,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {265#true} {265#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {265#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {277#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:18:16,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {265#true} is VALID [2022-04-07 23:18:16,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {265#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {265#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:16,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:16,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {271#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} is VALID [2022-04-07 23:18:16,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {272#(and (= main_~k~0 0) (<= main_~v4~0 1) (= main_~j~0 0) (<= 1 main_~v4~0) (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v4~0)) (= main_~l~0 0) (= main_~i~0 0))} is VALID [2022-04-07 23:18:16,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#(and (= main_~k~0 0) (<= main_~v4~0 1) (= main_~j~0 0) (<= 1 main_~v4~0) (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v4~0)) (= main_~l~0 0) (= main_~i~0 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {273#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (<= main_~v4~0 main_~l~0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-07 23:18:16,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {273#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (<= main_~v4~0 main_~l~0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {274#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= main_~v4~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} is VALID [2022-04-07 23:18:16,394 INFO L272 TraceCheckUtils]: 11: Hoare triple {274#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296)))) (<= main_~v4~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v4~0 1)))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {275#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 23:18:16,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(not (= |__VERIFIER_assert_#in~cond| 0))} [85] __VERIFIER_assertENTRY-->L9: 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] {276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 23:18:16,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {276#(not (= __VERIFIER_assert_~cond 0))} [89] L9-->L10: 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[] {266#false} is VALID [2022-04-07 23:18:16,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266#false} is VALID [2022-04-07 23:18:16,396 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-07 23:18:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:18:16,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046046301] [2022-04-07 23:18:16,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046046301] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:16,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189908384] [2022-04-07 23:18:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:16,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:18:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:18:16,399 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-07 23:18:16,433 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-07 23:18:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 23:18:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:16,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:18:16,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {265#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {265#true} is VALID [2022-04-07 23:18:16,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {265#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:16,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {265#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:16,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:16,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:16,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {270#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {305#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:16,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {305#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {309#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:16,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {309#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:16,810 INFO L272 TraceCheckUtils]: 11: Hoare triple {309#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:16,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {316#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:16,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {320#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {266#false} is VALID [2022-04-07 23:18:16,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266#false} is VALID [2022-04-07 23:18:16,812 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-07 23:18:16,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:18:17,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {266#false} is VALID [2022-04-07 23:18:17,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {320#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {266#false} is VALID [2022-04-07 23:18:17,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {316#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {320#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:17,121 INFO L272 TraceCheckUtils]: 11: Hoare triple {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {316#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:17,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:17,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {343#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:17,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {343#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 23:18:17,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:17,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:17,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {265#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {336#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:17,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {265#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:17,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {265#true} {265#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:17,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:17,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {265#true} is VALID [2022-04-07 23:18:17,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {265#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {265#true} is VALID [2022-04-07 23:18:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 23:18:17,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189908384] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:17,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:18:17,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-07 23:18:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918920568] [2022-04-07 23:18:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:18:17,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 23:18:17,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:18:17,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:17,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:17,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:18:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:18:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:18:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:18:17,193 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:19,360 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-07 23:18:21,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 23:18:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:21,740 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-07 23:18:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:18:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 23:18:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:18:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 23:18:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 23:18:21,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-07 23:18:21,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:21,786 INFO L225 Difference]: With dead ends: 28 [2022-04-07 23:18:21,786 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 23:18:21,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-07 23:18:21,787 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:18:21,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-07 23:18:21,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 23:18:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 23:18:21,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:18:21,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-07 23:18:21,791 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-07 23:18:21,792 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-07 23:18:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:21,793 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-07 23:18:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-07 23:18:21,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:21,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:21,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 23:18:21,794 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 23:18:21,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:21,796 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-07 23:18:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-07 23:18:21,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:21,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:21,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:18:21,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:18:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-07 23:18:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-07 23:18:21,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-07 23:18:21,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:18:21,798 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-07 23:18:21,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-07 23:18:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 23:18:21,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:18:21,799 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:18:21,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 23:18:22,014 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-07 23:18:22,015 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:18:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:18:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1246245489, now seen corresponding path program 1 times [2022-04-07 23:18:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:18:22,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200655029] [2022-04-07 23:18:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:18:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:18:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:22,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {501#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 23:18:22,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 23:18:22,422 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {491#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:18:22,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:18:22,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {501#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 23:18:22,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 23:18:22,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {502#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {491#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:18:22,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {496#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {496#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:18:22,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {496#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {497#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 23:18:22,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {497#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {498#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 23:18:22,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {498#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 23:18:22,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {498#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-07 23:18:22,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {498#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {499#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) 8569934592 main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-07 23:18:22,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {499#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) 8569934592 main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3))) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {500#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} is VALID [2022-04-07 23:18:22,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {500#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {500#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} is VALID [2022-04-07 23:18:22,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {500#(<= (+ (* 8589934592 (div main_~l~0 4294967296)) (* 6 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* 8589934593 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) (* main_~l~0 2))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {492#false} is VALID [2022-04-07 23:18:22,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {492#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {492#false} is VALID [2022-04-07 23:18:22,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#false} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {492#false} is VALID [2022-04-07 23:18:22,448 INFO L272 TraceCheckUtils]: 15: Hoare triple {492#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {492#false} is VALID [2022-04-07 23:18:22,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#false} [85] __VERIFIER_assertENTRY-->L9: 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] {492#false} is VALID [2022-04-07 23:18:22,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {492#false} [89] L9-->L10: 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[] {492#false} is VALID [2022-04-07 23:18:22,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#false} is VALID [2022-04-07 23:18:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:18:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:18:22,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200655029] [2022-04-07 23:18:22,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200655029] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:22,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668251514] [2022-04-07 23:18:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:18:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:18:22,456 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-07 23:18:22,479 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-07 23:18:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:22,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 23:18:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:22,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:18:23,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:23,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {491#true} is VALID [2022-04-07 23:18:23,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:23,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:23,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:23,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {521#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:23,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {521#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {521#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:23,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {521#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:23,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {531#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {531#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {535#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {535#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {535#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {535#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {545#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {549#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {549#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {549#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} is VALID [2022-04-07 23:18:23,106 INFO L272 TraceCheckUtils]: 15: Hoare triple {549#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~v4~0) 0))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:23,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:23,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {492#false} is VALID [2022-04-07 23:18:23,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#false} is VALID [2022-04-07 23:18:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:18:23,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:18:23,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#false} is VALID [2022-04-07 23:18:23,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {492#false} is VALID [2022-04-07 23:18:23,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {556#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:23,482 INFO L272 TraceCheckUtils]: 15: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:23,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:23,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {583#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,586 WARN L290 TraceCheckUtils]: 12: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {583#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 23:18:25,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {583#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {583#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 23:18:25,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {491#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {576#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:25,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {491#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:25,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {491#true} {491#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:25,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {491#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:25,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {491#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {491#true} is VALID [2022-04-07 23:18:25,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {491#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {491#true} is VALID [2022-04-07 23:18:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 23:18:25,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668251514] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:25,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:18:25,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 18 [2022-04-07 23:18:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456458926] [2022-04-07 23:18:25,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:18:25,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 23:18:25,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:18:25,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:27,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:27,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:18:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:18:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:18:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-07 23:18:27,801 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:29,926 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-07 23:18:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:30,249 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-04-07 23:18:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:18:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 23:18:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:18:30,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:30,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 23:18:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 23:18:30,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-07 23:18:32,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:32,393 INFO L225 Difference]: With dead ends: 31 [2022-04-07 23:18:32,393 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 23:18:32,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-07 23:18:32,394 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 23:18:32,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 23:18:32,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 23:18:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-07 23:18:32,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:18:32,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 23:18:32,400 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 23:18:32,400 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 23:18:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:32,401 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 23:18:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-07 23:18:32,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:32,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:32,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 26 states. [2022-04-07 23:18:32,402 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 26 states. [2022-04-07 23:18:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:32,404 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 23:18:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-07 23:18:32,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:32,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:32,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:18:32,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:18:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-07 23:18:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-07 23:18:32,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2022-04-07 23:18:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:18:32,406 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-07 23:18:32,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-07 23:18:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 23:18:32,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:18:32,407 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:18:32,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 23:18:32,621 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-07 23:18:32,621 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:18:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:18:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2062699915, now seen corresponding path program 1 times [2022-04-07 23:18:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:18:32,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995735701] [2022-04-07 23:18:32,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:32,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:18:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:18:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:32,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {761#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {754#true} is VALID [2022-04-07 23:18:32,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:32,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {754#true} {754#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:32,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {761#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:18:32,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {761#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {754#true} is VALID [2022-04-07 23:18:32,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:32,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:32,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:32,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {759#(= main_~l~0 0)} is VALID [2022-04-07 23:18:32,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {759#(= main_~l~0 0)} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {759#(= main_~l~0 0)} is VALID [2022-04-07 23:18:32,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(= main_~l~0 0)} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {759#(= main_~l~0 0)} is VALID [2022-04-07 23:18:32,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(= main_~l~0 0)} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {759#(= main_~l~0 0)} is VALID [2022-04-07 23:18:32,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {759#(= main_~l~0 0)} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 23:18:32,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 23:18:32,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 23:18:32,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 23:18:32,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {755#false} is VALID [2022-04-07 23:18:32,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {755#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {755#false} is VALID [2022-04-07 23:18:32,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {755#false} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {755#false} is VALID [2022-04-07 23:18:32,720 INFO L272 TraceCheckUtils]: 16: Hoare triple {755#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {755#false} is VALID [2022-04-07 23:18:32,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {755#false} [85] __VERIFIER_assertENTRY-->L9: 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] {755#false} is VALID [2022-04-07 23:18:32,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {755#false} [89] L9-->L10: 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[] {755#false} is VALID [2022-04-07 23:18:32,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {755#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#false} is VALID [2022-04-07 23:18:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:18:32,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:18:32,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995735701] [2022-04-07 23:18:32,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995735701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:32,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334830818] [2022-04-07 23:18:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:32,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:18:32,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:18:32,722 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-07 23:18:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 23:18:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:32,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 23:18:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:32,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:18:33,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {754#true} is VALID [2022-04-07 23:18:33,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {780#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:33,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {780#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:33,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {780#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:33,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {790#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {807#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {807#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {811#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {811#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {811#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:33,199 INFO L272 TraceCheckUtils]: 16: Hoare triple {811#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:33,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {818#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:33,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {755#false} is VALID [2022-04-07 23:18:33,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {755#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#false} is VALID [2022-04-07 23:18:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:18:33,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:18:33,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {755#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {755#false} is VALID [2022-04-07 23:18:33,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {755#false} is VALID [2022-04-07 23:18:33,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {818#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:33,477 INFO L272 TraceCheckUtils]: 16: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:33,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 23:18:33,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {845#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 23:18:33,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {754#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {838#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:33,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {754#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {754#true} {754#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {754#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {754#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {754#true} is VALID [2022-04-07 23:18:33,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {754#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {754#true} is VALID [2022-04-07 23:18:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 23:18:33,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334830818] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:33,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:18:33,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 23:18:33,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574798117] [2022-04-07 23:18:33,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:18:33,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 23:18:33,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:18:33,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:33,602 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-07 23:18:33,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:18:33,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:18:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:18:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 23:18:33,603 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:35,711 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-07 23:18:37,835 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-07 23:18:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:38,172 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 23:18:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:18:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 23:18:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:18:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 23:18:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-07 23:18:38,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-07 23:18:38,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:38,386 INFO L225 Difference]: With dead ends: 37 [2022-04-07 23:18:38,386 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 23:18:38,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 23:18:38,387 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-07 23:18:38,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-07 23:18:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 23:18:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 23:18:38,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:18:38,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-07 23:18:38,391 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-07 23:18:38,391 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-07 23:18:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:38,393 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 23:18:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 23:18:38,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:38,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:38,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 32 states. [2022-04-07 23:18:38,394 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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 32 states. [2022-04-07 23:18:38,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:38,396 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 23:18:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 23:18:38,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:38,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:38,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:18:38,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:18:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 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-07 23:18:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 23:18:38,398 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 20 [2022-04-07 23:18:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:18:38,398 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 23:18:38,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 23:18:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 23:18:38,399 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 23:18:38,399 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 23:18:38,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 23:18:38,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:18:38,608 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 23:18:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 23:18:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1398118099, now seen corresponding path program 1 times [2022-04-07 23:18:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 23:18:38,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656162446] [2022-04-07 23:18:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 23:18:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:38,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 23:18:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:38,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {1056#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1049#true} is VALID [2022-04-07 23:18:38,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:38,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1049#true} {1049#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:38,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {1049#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 23:18:38,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1049#true} is VALID [2022-04-07 23:18:38,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {1049#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:38,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1049#true} {1049#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:38,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {1049#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:38,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {1049#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {1054#(= main_~l~0 0)} is VALID [2022-04-07 23:18:38,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {1054#(= main_~l~0 0)} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1054#(= main_~l~0 0)} is VALID [2022-04-07 23:18:38,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {1054#(= main_~l~0 0)} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1054#(= main_~l~0 0)} is VALID [2022-04-07 23:18:38,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {1054#(= main_~l~0 0)} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {1054#(= main_~l~0 0)} is VALID [2022-04-07 23:18:38,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {1054#(= main_~l~0 0)} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1055#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-07 23:18:38,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {1055#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1055#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-07 23:18:38,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {1055#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1055#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} is VALID [2022-04-07 23:18:38,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {1055#(<= (+ (* (div main_~l~0 4294967296) 36893488151714070528) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 36893488151714070528) main_~n~0 (* 25769803776 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 4294967298) (+ (* (div main_~n~0 4294967296) 4294967296) (* 8589934593 main_~l~0)))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {1050#false} is VALID [2022-04-07 23:18:38,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {1050#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1050#false} is VALID [2022-04-07 23:18:38,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {1050#false} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:38,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {1050#false} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:38,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {1050#false} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:38,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1050#false} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1050#false} is VALID [2022-04-07 23:18:38,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {1050#false} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1050#false} is VALID [2022-04-07 23:18:38,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {1050#false} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:38,793 INFO L272 TraceCheckUtils]: 20: Hoare triple {1050#false} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {1050#false} is VALID [2022-04-07 23:18:38,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {1050#false} [85] __VERIFIER_assertENTRY-->L9: 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] {1050#false} is VALID [2022-04-07 23:18:38,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {1050#false} [89] L9-->L10: 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[] {1050#false} is VALID [2022-04-07 23:18:38,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {1050#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 23:18:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 23:18:38,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656162446] [2022-04-07 23:18:38,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656162446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:38,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255988564] [2022-04-07 23:18:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 23:18:38,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:18:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 23:18:38,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 23:18:38,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 23:18:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:38,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 23:18:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 23:18:38,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 23:18:39,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {1049#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:39,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1049#true} is VALID [2022-04-07 23:18:39,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {1049#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:39,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1049#true} {1049#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:39,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {1049#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:39,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {1049#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {1075#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:39,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1075#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:39,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {1075#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1075#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 23:18:39,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {1085#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {1085#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1089#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1089#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1089#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1089#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {1099#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {1103#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= main_~v4~0 1))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1116#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~i~0 1) (= main_~v4~0 1))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1120#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {1120#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1120#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} is VALID [2022-04-07 23:18:39,442 INFO L272 TraceCheckUtils]: 20: Hoare triple {1120#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 1) (= main_~l~0 3) (= main_~v4~0 1))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:39,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {1131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:39,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {1131#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {1050#false} is VALID [2022-04-07 23:18:39,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {1050#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 23:18:39,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 23:18:39,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {1050#false} [93] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1050#false} is VALID [2022-04-07 23:18:39,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {1131#(<= 1 __VERIFIER_assert_~cond)} [89] L9-->L10: 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[] {1050#false} is VALID [2022-04-07 23:18:39,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} [85] __VERIFIER_assertENTRY-->L9: 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] {1131#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 23:18:39,811 INFO L272 TraceCheckUtils]: 20: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [81] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296) (mod v_main_~l~0_13 4294967296)) 1 0)) InVars {main_~i~0=v_main_~i~0_5, main_~l~0=v_main_~l~0_13, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~k~0, main_~v4~0, main_~j~0, main_~i~0] {1127#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 23:18:39,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [79] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:39,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:39,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L27-->L27-2: Formula: (and (= (mod v_main_~l~0_2 2) 0) (= v_main_~j~0_1 (+ v_main_~j~0_2 1))) InVars {main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~j~0] {1154#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 23:18:39,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [88] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:39,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:39,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:39,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {1154#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,942 WARN L290 TraceCheckUtils]: 12: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [87] L25-->L27-2: Formula: (and (= (mod (mod (mod v_main_~l~0_12 4294967296) 3) 4294967296) 0) (= v_main_~i~0_3 (+ v_main_~i~0_4 1))) InVars {main_~i~0=v_main_~i~0_4, main_~l~0=v_main_~l~0_12} OutVars{main_~i~0=v_main_~i~0_3, main_~l~0=v_main_~l~0_12} AuxVars[] AssignedVars[main_~i~0] {1154#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 23:18:41,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [83] L23-->L25: Formula: (not (= (mod v_main_~l~0_11 4) 0)) InVars {main_~l~0=v_main_~l~0_11} OutVars{main_~l~0=v_main_~l~0_11} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [86] L27-2-->L21-2: Formula: (= v_main_~l~0_4 (+ v_main_~l~0_5 1)) InVars {main_~l~0=v_main_~l~0_5} OutVars{main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~l~0] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [82] L23-->L27-2: Formula: (and (= (mod v_main_~l~0_10 4) 0) (= v_main_~v4~0_3 (+ v_main_~v4~0_4 1))) InVars {main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_4} OutVars{main_~l~0=v_main_~l~0_10, main_~v4~0=v_main_~v4~0_3} AuxVars[] AssignedVars[main_~v4~0] {1154#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 23:18:41,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [80] L21-2-->L23: Formula: (< (mod v_main_~l~0_9 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_9, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [76] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {1049#true} [73] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_1 0) (= v_main_~i~0_1 0) (= v_main_~j~0_3 0) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_3 0) (= v_main_~l~0_6 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_6, main_~v4~0=v_main_~v4~0_1, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3, main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {1147#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 23:18:41,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {1049#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:41,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1049#true} {1049#true} [96] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:41,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {1049#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:41,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1049#true} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {1049#true} is VALID [2022-04-07 23:18:41,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {1049#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1049#true} is VALID [2022-04-07 23:18:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 23:18:41,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255988564] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 23:18:41,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 23:18:41,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-07 23:18:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961683990] [2022-04-07 23:18:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 23:18:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 23:18:41,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 23:18:41,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:44,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:44,186 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 23:18:44,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 23:18:44,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 23:18:44,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-04-07 23:18:44,187 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:46,294 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-07 23:18:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:46,533 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 23:18:46,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 23:18:46,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 23:18:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 23:18:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:46,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-07 23:18:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-07 23:18:46,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-07 23:18:48,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 23:18:48,802 INFO L225 Difference]: With dead ends: 32 [2022-04-07 23:18:48,802 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 23:18:48,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-04-07 23:18:48,804 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 23:18:48,804 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 23:18:48,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 23:18:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 23:18:48,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 23:18:48,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:18:48,805 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:18:48,805 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:18:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:48,805 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:18:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:18:48,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:48,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:48,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:18:48,806 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 23:18:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 23:18:48,806 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 23:18:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:18:48,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:48,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 23:18:48,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 23:18:48,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 23:18:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 23:18:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 23:18:48,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-07 23:18:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 23:18:48,807 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 23:18:48,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 23:18:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 23:18:48,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 23:18:48,809 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 23:18:48,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 23:18:49,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 23:18:49,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 23:18:49,071 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 23:18:49,071 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:18:49,071 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:18:49,071 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 23:18:49,071 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 23:18:49,071 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 23:18:49,071 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 23:18:49,071 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 35) the Hoare annotation is: true [2022-04-07 23:18:49,071 INFO L882 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-04-07 23:18:49,071 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 16 35) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 32) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 16 35) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 32) the Hoare annotation is: (= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296)) [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L23(lines 23 30) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L27-2(lines 23 30) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L25(lines 25 30) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L27(lines 27 30) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-07 23:18:49,072 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2022-04-07 23:18:49,073 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-07 23:18:49,073 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2022-04-07 23:18:49,075 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-07 23:18:49,076 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 23:18:49,080 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 23:18:49,081 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:18:49,081 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 23:18:49,081 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-07 23:18:49,081 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 23:18:49,082 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-07 23:18:49,082 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 23:18:49,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 11:18:49 BasicIcfg [2022-04-07 23:18:49,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 23:18:49,094 INFO L158 Benchmark]: Toolchain (without parser) took 48419.35ms. Allocated memory was 178.3MB in the beginning and 245.4MB in the end (delta: 67.1MB). Free memory was 120.3MB in the beginning and 135.0MB in the end (delta: -14.7MB). Peak memory consumption was 53.8MB. Max. memory is 8.0GB. [2022-04-07 23:18:49,094 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 23:18:49,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.10ms. Allocated memory was 178.3MB in the beginning and 245.4MB in the end (delta: 67.1MB). Free memory was 120.1MB in the beginning and 214.8MB in the end (delta: -94.7MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-04-07 23:18:49,095 INFO L158 Benchmark]: Boogie Preprocessor took 46.82ms. Allocated memory is still 245.4MB. Free memory was 214.8MB in the beginning and 213.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:18:49,095 INFO L158 Benchmark]: RCFGBuilder took 2472.12ms. Allocated memory is still 245.4MB. Free memory was 213.3MB in the beginning and 201.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 23:18:49,095 INFO L158 Benchmark]: IcfgTransformer took 42.04ms. Allocated memory is still 245.4MB. Free memory was 201.2MB in the beginning and 199.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 23:18:49,095 INFO L158 Benchmark]: TraceAbstraction took 45551.92ms. Allocated memory is still 245.4MB. Free memory was 199.1MB in the beginning and 135.0MB in the end (delta: 64.1MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. [2022-04-07 23:18:49,101 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.10ms. Allocated memory was 178.3MB in the beginning and 245.4MB in the end (delta: 67.1MB). Free memory was 120.1MB in the beginning and 214.8MB in the end (delta: -94.7MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.82ms. Allocated memory is still 245.4MB. Free memory was 214.8MB in the beginning and 213.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 2472.12ms. Allocated memory is still 245.4MB. Free memory was 213.3MB in the beginning and 201.2MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 42.04ms. Allocated memory is still 245.4MB. Free memory was 201.2MB in the beginning and 199.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 45551.92ms. Allocated memory is still 245.4MB. Free memory was 199.1MB in the beginning and 135.0MB in the end (delta: 64.1MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.5s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 18.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 82 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 126 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 17 NumberOfFragments, 36 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 45 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2161 SizeOfPredicates, 4 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 41/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (i + k + j + v4) % 4294967296 == l % 4294967296 RESULT: Ultimate proved your program to be correct! [2022-04-07 23:18:49,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...