/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/sum_by_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 22:19:35,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 22:19:35,311 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 22:19:35,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 22:19:35,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 22:19:35,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 22:19:35,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 22:19:35,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 22:19:35,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 22:19:35,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 22:19:35,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 22:19:35,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 22:19:35,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 22:19:35,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 22:19:35,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 22:19:35,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 22:19:35,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 22:19:35,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 22:19:35,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 22:19:35,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 22:19:35,363 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 22:19:35,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 22:19:35,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 22:19:35,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 22:19:35,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 22:19:35,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 22:19:35,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 22:19:35,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 22:19:35,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 22:19:35,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 22:19:35,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 22:19:35,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 22:19:35,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 22:19:35,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 22:19:35,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 22:19:35,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 22:19:35,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 22:19:35,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 22:19:35,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 22:19:35,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 22:19:35,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 22:19:35,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 22:19:35,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 22:19:35,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 22:19:35,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 22:19:35,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 22:19:35,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 22:19:35,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 22:19:35,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 22:19:35,398 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 22:19:35,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 22:19:35,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 22:19:35,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 22:19:35,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 22:19:35,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:19:35,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 22:19:35,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 22:19:35,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 22:19:35,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 22:19:35,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 22:19:35,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 22:19:35,400 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 22:19:35,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 22:19:35,401 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 22:19:35,401 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 22:19:35,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 22:19:35,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 22:19:35,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 22:19:35,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 22:19:35,584 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 22:19:35,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-27 22:19:35,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e88f636d/fcb00718d5a44f969c128ba51bf9b5b0/FLAG4fd3bf88a [2022-04-27 22:19:36,005 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 22:19:36,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_by_3.c [2022-04-27 22:19:36,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e88f636d/fcb00718d5a44f969c128ba51bf9b5b0/FLAG4fd3bf88a [2022-04-27 22:19:36,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e88f636d/fcb00718d5a44f969c128ba51bf9b5b0 [2022-04-27 22:19:36,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 22:19:36,024 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 22:19:36,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 22:19:36,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 22:19:36,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 22:19:36,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57dfaeb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36, skipping insertion in model container [2022-04-27 22:19:36,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 22:19:36,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 22:19:36,192 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/sum_by_3.c[406,419] [2022-04-27 22:19:36,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:19:36,209 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 22:19:36,218 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/sum_by_3.c[406,419] [2022-04-27 22:19:36,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 22:19:36,242 INFO L208 MainTranslator]: Completed translation [2022-04-27 22:19:36,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36 WrapperNode [2022-04-27 22:19:36,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 22:19:36,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 22:19:36,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 22:19:36,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 22:19:36,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 22:19:36,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 22:19:36,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 22:19:36,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 22:19:36,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 22:19:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:19:36,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 22:19:36,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 22:19:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 22:19:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 22:19:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 22:19:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 22:19:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 22:19:36,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 22:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 22:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 22:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 22:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 22:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 22:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 22:19:36,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 22:19:36,404 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 22:19:36,405 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 22:19:36,592 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 22:19:36,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 22:19:36,598 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 22:19:36,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:36 BoogieIcfgContainer [2022-04-27 22:19:36,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 22:19:36,599 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 22:19:36,599 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 22:19:36,600 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 22:19:36,602 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:36" (1/1) ... [2022-04-27 22:19:36,603 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 22:19:36,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:19:36 BasicIcfg [2022-04-27 22:19:36,634 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 22:19:36,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 22:19:36,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 22:19:36,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 22:19:36,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:19:36" (1/4) ... [2022-04-27 22:19:36,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7749ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:36, skipping insertion in model container [2022-04-27 22:19:36,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:19:36" (2/4) ... [2022-04-27 22:19:36,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7749ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:19:36, skipping insertion in model container [2022-04-27 22:19:36,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:19:36" (3/4) ... [2022-04-27 22:19:36,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7749ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:19:36, skipping insertion in model container [2022-04-27 22:19:36,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 10:19:36" (4/4) ... [2022-04-27 22:19:36,639 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_by_3.cqvasr [2022-04-27 22:19:36,648 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 22:19:36,648 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 22:19:36,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 22:19:36,681 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e6a7422, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bc1c757 [2022-04-27 22:19:36,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 22:19:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 22:19:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 22:19:36,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:36,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:36,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1502834522, now seen corresponding path program 1 times [2022-04-27 22:19:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:36,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420979588] [2022-04-27 22:19:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:36,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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-27 22:19:36,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 22:19:36,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 22:19:36,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [78] 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-27 22:19:36,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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-27 22:19:36,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 22:19:36,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 22:19:36,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 22:19:36,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {27#true} is VALID [2022-04-27 22:19:36,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {27#true} is VALID [2022-04-27 22:19:36,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} [87] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 22:19:36,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {28#false} is VALID [2022-04-27 22:19:36,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} [91] L25-2-->L25-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 22:19:36,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {28#false} is VALID [2022-04-27 22:19:36,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 22:19:36,870 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {28#false} is VALID [2022-04-27 22:19:36,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {28#false} is VALID [2022-04-27 22:19:36,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 22:19:36,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 22:19:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:36,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:36,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420979588] [2022-04-27 22:19:36,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420979588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:36,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:19:36,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 22:19:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280388874] [2022-04-27 22:19:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-27 22:19:36,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:36,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:36,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:36,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 22:19:36,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:36,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 22:19:36,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:19:36,930 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:36,997 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-27 22:19:36,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 22:19:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-04-27 22:19:36,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 22:19:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-27 22:19:37,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-27 22:19:37,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:37,076 INFO L225 Difference]: With dead ends: 40 [2022-04-27 22:19:37,076 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 22:19:37,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 22:19:37,084 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 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-27 22:19:37,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:19:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 22:19:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 22:19:37,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:37,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,111 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,112 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:37,116 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 22:19:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 22:19:37,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:37,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:37,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 22:19:37,117 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 22:19:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:37,119 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 22:19:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 22:19:37,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:37,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:37,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:37,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 22:19:37,121 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-27 22:19:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:37,122 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 22:19:37,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 22:19:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 22:19:37,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:37,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:37,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 22:19:37,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1872181992, now seen corresponding path program 1 times [2022-04-27 22:19:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:37,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292428978] [2022-04-27 22:19:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:37,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {148#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {148#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:37,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {148#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:37,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:37,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:37,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(and (<= 20000001 ~SIZE~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:37,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:37,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (= main_~i~0 0) (<= (div ~SIZE~0 4294967296) 0))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 22:19:37,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 22:19:37,608 INFO L272 TraceCheckUtils]: 12: Hoare triple {156#(and (<= 60000003 (* ~SIZE~0 3)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~i~0 0) (= main_~k~0 main_~j~0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {157#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:19:37,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {157#(not (= |__VERIFIER_assert_#in~cond| 0))} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {158#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:19:37,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {158#(not (= __VERIFIER_assert_~cond 0))} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {149#false} is VALID [2022-04-27 22:19:37,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {149#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {149#false} is VALID [2022-04-27 22:19:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:37,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292428978] [2022-04-27 22:19:37,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292428978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:37,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:19:37,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 22:19:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43702219] [2022-04-27 22:19:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 22:19:37,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:37,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:39,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:39,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 22:19:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:39,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 22:19:39,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-27 22:19:39,736 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:40,321 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-27 22:19:40,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 22:19:40,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 22:19:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-27 22:19:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-27 22:19:40,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-27 22:19:40,376 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-27 22:19:40,378 INFO L225 Difference]: With dead ends: 33 [2022-04-27 22:19:40,379 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 22:19:40,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-27 22:19:40,383 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:40,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 23 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 22:19:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 22:19:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-04-27 22:19:40,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:40,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 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-27 22:19:40,404 INFO L74 IsIncluded]: Start isIncluded. First operand 28 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-27 22:19:40,404 INFO L87 Difference]: Start difference. First operand 28 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-27 22:19:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:40,406 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-27 22:19:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 22:19:40,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:40,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:40,408 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 28 states. [2022-04-27 22:19:40,409 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 28 states. [2022-04-27 22:19:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:40,411 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-04-27 22:19:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-27 22:19:40,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:40,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:40,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:40,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:40,413 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-27 22:19:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-27 22:19:40,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2022-04-27 22:19:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:40,425 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-27 22:19:40,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 22:19:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:19:40,426 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:40,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:40,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 22:19:40,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:40,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2065178785, now seen corresponding path program 1 times [2022-04-27 22:19:40,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:40,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359803654] [2022-04-27 22:19:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:40,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:40,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {316#true} is VALID [2022-04-27 22:19:40,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#true} is VALID [2022-04-27 22:19:40,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#true} is VALID [2022-04-27 22:19:40,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {323#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:40,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {316#true} is VALID [2022-04-27 22:19:40,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#true} is VALID [2022-04-27 22:19:40,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#true} is VALID [2022-04-27 22:19:40,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {316#true} is VALID [2022-04-27 22:19:40,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {316#true} is VALID [2022-04-27 22:19:40,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {316#true} is VALID [2022-04-27 22:19:40,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#true} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {316#true} is VALID [2022-04-27 22:19:40,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#true} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {316#true} is VALID [2022-04-27 22:19:40,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {316#true} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {321#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-27 22:19:40,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#(<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296)))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {322#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} is VALID [2022-04-27 22:19:40,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {322#(and (<= (+ main_~n~0 (* 4294967296 (div main_~j~0 4294967296))) (+ main_~j~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~k~0 main_~j~0))} [97] L29-2-->L29-2: Formula: (and (< (mod v_main_~k~0_5 4294967296) (mod v_main_~n~0_9 4294967296)) (= v_main_~k~0_4 (+ v_main_~k~0_5 1))) InVars {main_~k~0=v_main_~k~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_4, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0] {317#false} is VALID [2022-04-27 22:19:40,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {317#false} is VALID [2022-04-27 22:19:40,544 INFO L272 TraceCheckUtils]: 13: Hoare triple {317#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {317#false} is VALID [2022-04-27 22:19:40,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {317#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {317#false} is VALID [2022-04-27 22:19:40,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {317#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {317#false} is VALID [2022-04-27 22:19:40,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {317#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {317#false} is VALID [2022-04-27 22:19:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:40,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359803654] [2022-04-27 22:19:40,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359803654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:40,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:19:40,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:19:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738192948] [2022-04-27 22:19:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:40,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 22:19:40,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:40,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:40,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:19:40,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:19:40,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:19:40,562 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:40,707 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 22:19:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:19:40,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 22:19:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 22:19:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-27 22:19:40,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-27 22:19:40,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:40,735 INFO L225 Difference]: With dead ends: 28 [2022-04-27 22:19:40,735 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 22:19:40,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 22:19:40,736 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:40,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:19:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 22:19:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 22:19:40,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:40,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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-27 22:19:40,754 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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-27 22:19:40,754 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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-27 22:19:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:40,755 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 22:19:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 22:19:40,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:40,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:40,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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 20 states. [2022-04-27 22:19:40,756 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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 20 states. [2022-04-27 22:19:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:40,757 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 22:19:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 22:19:40,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:40,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:40,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:40,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 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-27 22:19:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 22:19:40,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-27 22:19:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:40,758 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 22:19:40,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 22:19:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:19:40,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:40,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 22:19:40,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2111704031, now seen corresponding path program 1 times [2022-04-27 22:19:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400936794] [2022-04-27 22:19:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:40,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {444#true} is VALID [2022-04-27 22:19:40,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 22:19:40,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 22:19:40,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {444#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {451#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:40,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {444#true} is VALID [2022-04-27 22:19:40,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 22:19:40,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {444#true} {444#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 22:19:40,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {444#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#true} is VALID [2022-04-27 22:19:40,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {444#true} is VALID [2022-04-27 22:19:40,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {449#(= main_~i~0 0)} is VALID [2022-04-27 22:19:40,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#(= main_~i~0 0)} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 22:19:40,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 22:19:40,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#(and (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {445#false} is VALID [2022-04-27 22:19:40,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#false} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 22:19:40,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#false} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {445#false} is VALID [2022-04-27 22:19:40,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 22:19:40,867 INFO L272 TraceCheckUtils]: 13: Hoare triple {445#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {445#false} is VALID [2022-04-27 22:19:40,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {445#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {445#false} is VALID [2022-04-27 22:19:40,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {445#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 22:19:40,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {445#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {445#false} is VALID [2022-04-27 22:19:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:40,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:40,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400936794] [2022-04-27 22:19:40,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400936794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 22:19:40,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 22:19:40,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 22:19:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866096259] [2022-04-27 22:19:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 22:19:40,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 22:19:40,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:19:40,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:40,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:40,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 22:19:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:19:40,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 22:19:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 22:19:40,884 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:41,021 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-27 22:19:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 22:19:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 17 [2022-04-27 22:19:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:19:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 22:19:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 22:19:41,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 22:19:41,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 22:19:41,055 INFO L225 Difference]: With dead ends: 28 [2022-04-27 22:19:41,055 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 22:19:41,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 22:19:41,056 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 22:19:41,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 22:19:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 22:19:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 22:19:41,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:19:41,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,075 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,076 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:41,077 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 22:19:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 22:19:41,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:41,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:41,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 22:19:41,078 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 22:19:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:19:41,082 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-27 22:19:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 22:19:41,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:19:41,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:19:41,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:19:41,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:19:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 22:19:41,085 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2022-04-27 22:19:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:19:41,085 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 22:19:41,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:19:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 22:19:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 22:19:41,086 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:19:41,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:19:41,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 22:19:41,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:19:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:19:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash 301668447, now seen corresponding path program 1 times [2022-04-27 22:19:41,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:19:41,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046445251] [2022-04-27 22:19:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:19:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:19:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:41,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {565#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {577#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:19:41,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {565#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:41,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {571#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} is VALID [2022-04-27 22:19:41,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#(and (<= 20000001 ~SIZE~0) (<= (+ main_~n~0 (* (div ~SIZE~0 4294967296) 4294967296)) (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~i~0 0))} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:41,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:41,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {572#(and (<= (+ 20000000 main_~i~0) ~SIZE~0) (<= main_~i~0 1) (<= 1 main_~i~0) (<= (div ~SIZE~0 4294967296) 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:41,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:41,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(and (or (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0)) 0)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0 (* (- 1) main_~j~0) (- 4294967296)) 0))) (or (<= 8589934595 (* main_~i~0 3)) (and (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))) (<= 3 (* main_~i~0 3)))) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (<= (div ~SIZE~0 4294967296) 0))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:41,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} is VALID [2022-04-27 22:19:41,748 INFO L272 TraceCheckUtils]: 13: Hoare triple {574#(and (<= (* 3 (div ~SIZE~0 4294967296)) (+ (* (div (div (+ (* (- 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296)) main_~i~0 main_~k~0 main_~j~0) 3) 4294967296) 3) (* 2 (div main_~i~0 4294967296)) (div (+ main_~i~0 main_~k~0 main_~j~0) 4294967296))) (= main_~k~0 main_~j~0) (or (<= (+ 60000000 (* main_~i~0 3)) (* ~SIZE~0 3)) (and (not (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (<= (* main_~i~0 3) (+ 8529934592 (* ~SIZE~0 3))))) (or (and (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296)))) (= (+ main_~j~0 4294967296 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0)) (<= (div ~SIZE~0 4294967296) 0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {575#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 22:19:41,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#(not (= |__VERIFIER_assert_#in~cond| 0))} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {576#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:19:41,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {576#(not (= __VERIFIER_assert_~cond 0))} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {566#false} is VALID [2022-04-27 22:19:41,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#false} is VALID [2022-04-27 22:19:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:41,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:19:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046445251] [2022-04-27 22:19:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046445251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:19:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992188596] [2022-04-27 22:19:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:19:41,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:19:41,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:19:41,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:19:41,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 22:19:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:41,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 22:19:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:19:41,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:19:42,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#true} is VALID [2022-04-27 22:19:42,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:42,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:42,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {565#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:42,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:42,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-27 22:19:42,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {570#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {599#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-27 22:19:42,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {603#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:19:42,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {607#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1))} is VALID [2022-04-27 22:19:42,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 22:19:42,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 22:19:42,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= (mod main_~i~0 4294967296) main_~j~0))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 22:19:42,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} is VALID [2022-04-27 22:19:42,961 INFO L272 TraceCheckUtils]: 13: Hoare triple {618#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001) (= main_~i~0 1) (= main_~k~0 main_~j~0) (= (mod main_~i~0 4294967296) main_~j~0))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:19:42,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:19:42,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {566#false} is VALID [2022-04-27 22:19:42,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#false} is VALID [2022-04-27 22:19:42,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:19:42,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:19:47,349 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~i~0 4294967296))) (let ((.cse1 (<= (mod (div (mod (+ (* .cse2 2) c_main_~i~0) 4294967296) 3) 4294967296) (mod c_~SIZE~0 4294967296))) (.cse0 (<= .cse2 2147483647))) (and (or (not .cse0) .cse1) (or .cse1 .cse0)))) is different from true [2022-04-27 22:20:02,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {566#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#false} is VALID [2022-04-27 22:20:02,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {629#(<= 1 __VERIFIER_assert_~cond)} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {566#false} is VALID [2022-04-27 22:20:02,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {625#(<= 1 |__VERIFIER_assert_#in~cond|)} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {629#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 22:20:02,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {625#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:20:02,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 22:20:02,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {645#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 22:20:02,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 22:20:04,760 WARN L290 TraceCheckUtils]: 9: Hoare triple {659#(and (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (<= (mod main_~i~0 4294967296) 2147483647)) (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (<= (mod main_~i~0 4294967296) 2147483647))))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {652#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is UNKNOWN [2022-04-27 22:20:04,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {663#(or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {659#(and (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (<= (mod main_~i~0 4294967296) 2147483647)) (or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (<= (mod main_~i~0 4294967296) 2147483647))))} is VALID [2022-04-27 22:20:06,860 WARN L290 TraceCheckUtils]: 7: Hoare triple {667#(or (<= (mod (div (mod (+ (* 2 (mod (+ main_~i~0 1) 4294967296)) main_~i~0 1) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296)))} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {663#(or (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2)) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is UNKNOWN [2022-04-27 22:20:06,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {565#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {667#(or (<= (mod (div (mod (+ (* 2 (mod (+ main_~i~0 1) 4294967296)) main_~i~0 1) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (< (mod (+ main_~i~0 1) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-27 22:20:06,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {565#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {565#true} is VALID [2022-04-27 22:20:06,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {565#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#true} is VALID [2022-04-27 22:20:06,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#true} is VALID [2022-04-27 22:20:06,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#true} is VALID [2022-04-27 22:20:06,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {565#true} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {565#true} is VALID [2022-04-27 22:20:06,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {565#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {565#true} is VALID [2022-04-27 22:20:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:20:06,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992188596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:20:06,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:20:06,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2022-04-27 22:20:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057437413] [2022-04-27 22:20:06,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:20:06,873 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 22:20:06,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:20:06,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:20:13,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 39 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:20:13,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-27 22:20:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:20:13,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-27 22:20:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=339, Unknown=6, NotChecked=38, Total=462 [2022-04-27 22:20:13,272 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:20:24,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:21:28,298 WARN L232 SmtUtils]: Spent 53.24s on a formula simplification. DAG size of input: 46 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:21:39,319 WARN L232 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:22:06,117 WARN L232 SmtUtils]: Spent 18.04s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:22:08,240 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-27 22:22:10,390 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-27 22:22:12,609 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-27 22:22:14,770 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-27 22:22:19,088 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-27 22:22:25,809 WARN L232 SmtUtils]: Spent 6.50s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:22:36,826 WARN L232 SmtUtils]: Spent 10.94s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:22:56,438 WARN L232 SmtUtils]: Spent 12.97s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:22:58,479 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-27 22:23:00,609 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-27 22:23:02,828 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-27 22:23:05,005 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-27 22:23:07,222 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-27 22:23:27,401 WARN L232 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:23:29,439 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-27 22:23:38,191 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-27 22:23:42,516 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-27 22:23:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:42,685 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-27 22:23:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 22:23:42,685 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 22:23:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:23:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:23:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 55 transitions. [2022-04-27 22:23:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:23:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 55 transitions. [2022-04-27 22:23:42,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 55 transitions. [2022-04-27 22:23:49,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 52 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:23:49,181 INFO L225 Difference]: With dead ends: 47 [2022-04-27 22:23:49,181 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 22:23:49,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 182.6s TimeCoverageRelationStatistics Valid=312, Invalid=1153, Unknown=21, NotChecked=74, Total=1560 [2022-04-27 22:23:49,182 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 135 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 45 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2022-04-27 22:23:49,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 37 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 162 Invalid, 14 Unknown, 32 Unchecked, 29.7s Time] [2022-04-27 22:23:49,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 22:23:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-04-27 22:23:49,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:23:49,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:49,224 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:49,224 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:49,225 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 22:23:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 22:23:49,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:23:49,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:23:49,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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 34 states. [2022-04-27 22:23:49,225 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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 34 states. [2022-04-27 22:23:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:23:49,226 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 22:23:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-27 22:23:49,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:23:49,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:23:49,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:23:49,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:23:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:23:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-27 22:23:49,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 17 [2022-04-27 22:23:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:23:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-27 22:23:49,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 19 states have internal predecessors, (33), 5 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 22:23:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-27 22:23:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 22:23:49,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:23:49,228 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:23:49,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 22:23:49,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:23:49,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:23:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:23:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -783043201, now seen corresponding path program 1 times [2022-04-27 22:23:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:23:49,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746373062] [2022-04-27 22:23:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:23:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:23:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:23:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:49,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {926#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {917#true} is VALID [2022-04-27 22:23:49,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:49,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:49,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {926#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:23:49,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {926#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {917#true} is VALID [2022-04-27 22:23:49,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:49,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:49,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:49,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {917#true} is VALID [2022-04-27 22:23:49,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {922#(= main_~i~0 0)} is VALID [2022-04-27 22:23:49,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#(= main_~i~0 0)} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {923#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} is VALID [2022-04-27 22:23:49,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {923#(and (<= main_~i~0 1) (not (<= (+ (div main_~i~0 4294967296) 1) 0)))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {924#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= main_~i~0 1) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 22:23:49,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= main_~i~0 1) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {925#(and (<= (+ (div main_~i~0 4294967296) (div main_~j~0 4294967296)) 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} is VALID [2022-04-27 22:23:49,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {925#(and (<= (+ (div main_~i~0 4294967296) (div main_~j~0 4294967296)) 0) (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {918#false} is VALID [2022-04-27 22:23:49,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {918#false} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {918#false} is VALID [2022-04-27 22:23:49,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {918#false} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:49,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {918#false} is VALID [2022-04-27 22:23:49,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {918#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:49,622 INFO L272 TraceCheckUtils]: 15: Hoare triple {918#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {918#false} is VALID [2022-04-27 22:23:49,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {918#false} is VALID [2022-04-27 22:23:49,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:49,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {918#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:23:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:23:49,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746373062] [2022-04-27 22:23:49,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746373062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:23:49,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74010642] [2022-04-27 22:23:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:23:49,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:23:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:23:49,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 22:23:49,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 22:23:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 22:23:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:23:49,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 22:23:53,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:53,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {917#true} is VALID [2022-04-27 22:23:53,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:53,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:53,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:23:53,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {917#true} is VALID [2022-04-27 22:23:53,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {948#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} is VALID [2022-04-27 22:23:53,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= main_~i~0 0))} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {952#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:23:53,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {952#(and (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {956#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:23:53,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {960#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (mod main_~i~0 4294967296) main_~j~0) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:23:53,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {960#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (= (mod main_~i~0 4294967296) main_~j~0) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {964#(and (= main_~j~0 (+ (mod main_~i~0 4294967296) 1)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-27 22:23:53,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(and (= main_~j~0 (+ (mod main_~i~0 4294967296) 1)) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod main_~n~0 4294967296) (mod ~SIZE~0 4294967296)) (< (mod (+ main_~i~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (= (+ (- 1) main_~i~0) 0))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {918#false} is VALID [2022-04-27 22:23:53,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {918#false} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {918#false} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {918#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L272 TraceCheckUtils]: 15: Hoare triple {918#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {918#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:23:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:23:53,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 22:24:36,706 WARN L232 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:24:36,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {918#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:24:36,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {992#(not (<= __VERIFIER_assert_~cond 0))} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {918#false} is VALID [2022-04-27 22:24:36,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {996#(< 0 |__VERIFIER_assert_#in~cond|)} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {992#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 22:24:36,745 INFO L272 TraceCheckUtils]: 15: Hoare triple {1000#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {996#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 22:24:36,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {1000#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1000#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 22:24:36,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1007#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1000#(<= (mod (div (mod (+ main_~i~0 main_~k~0 main_~j~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 22:24:36,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1007#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is VALID [2022-04-27 22:24:38,873 WARN L290 TraceCheckUtils]: 11: Hoare triple {1014#(or (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 2) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {1007#(<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296))} is UNKNOWN [2022-04-27 22:24:40,997 WARN L290 TraceCheckUtils]: 10: Hoare triple {1018#(or (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~n~0 4294967296))))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {1014#(or (not (< (mod main_~j~0 4294967296) (mod main_~n~0 4294967296))) (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 2) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-27 22:24:43,129 WARN L290 TraceCheckUtils]: 9: Hoare triple {1022#(or (<= (div (+ (* (- 1) (mod main_~i~0 4294967296)) 4294967294) (- 4294967296)) (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod main_~n~0 4294967296)) (- 4294967295)) 4294967296) 1)) (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2) 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1018#(or (<= (mod (div (mod (+ (* main_~j~0 2) main_~i~0 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)) (not (< (mod (+ main_~j~0 1) 4294967296) (mod main_~n~0 4294967296))))} is UNKNOWN [2022-04-27 22:24:43,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#true} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1022#(or (<= (div (+ (* (- 1) (mod main_~i~0 4294967296)) 4294967294) (- 4294967296)) (+ (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod main_~n~0 4294967296)) (- 4294967295)) 4294967296) 1)) (<= (mod (div (mod (+ main_~i~0 (* (mod main_~i~0 4294967296) 2) 4) 4294967296) 3) 4294967296) (mod ~SIZE~0 4294967296)))} is VALID [2022-04-27 22:24:43,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#true} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {917#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {917#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {917#true} {917#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#true} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {917#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#true} is VALID [2022-04-27 22:24:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 22:24:43,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74010642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 22:24:43,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 22:24:43,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2022-04-27 22:24:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462806129] [2022-04-27 22:24:43,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 22:24:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 22:24:43,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 22:24:43,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:49,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 36 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 22:24:49,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 22:24:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 22:24:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 22:24:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=260, Unknown=11, NotChecked=0, Total=342 [2022-04-27 22:24:49,552 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:24:51,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:00,194 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-27 22:25:13,134 WARN L232 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:25:15,142 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-27 22:25:17,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:23,779 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-27 22:25:25,954 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-27 22:25:28,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:25:38,963 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-27 22:25:41,129 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-27 22:26:02,941 WARN L232 SmtUtils]: Spent 17.28s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:26:04,950 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-27 22:26:09,415 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-27 22:26:11,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:26:26,633 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-27 22:26:37,736 WARN L232 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:26:41,930 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-27 22:26:44,092 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-27 22:26:50,579 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-27 22:27:29,906 WARN L232 SmtUtils]: Spent 26.14s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:27:31,965 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-27 22:27:34,109 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-27 22:27:36,319 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-27 22:27:38,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:28:02,692 WARN L232 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 22:28:09,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-27 22:28:11,420 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-27 22:28:13,654 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-27 22:28:15,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 22:28:17,948 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-27 22:28:24,504 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-27 22:28:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:28:24,723 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-04-27 22:28:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 22:28:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 22:28:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 22:28:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2022-04-27 22:28:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2022-04-27 22:28:24,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 46 transitions. [2022-04-27 22:28:33,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 42 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 22:28:33,425 INFO L225 Difference]: With dead ends: 45 [2022-04-27 22:28:33,425 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 22:28:33,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 158.4s TimeCoverageRelationStatistics Valid=180, Invalid=778, Unknown=34, NotChecked=0, Total=992 [2022-04-27 22:28:33,430 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 14 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.6s IncrementalHoareTripleChecker+Time [2022-04-27 22:28:33,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 53 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 186 Invalid, 26 Unknown, 0 Unchecked, 55.6s Time] [2022-04-27 22:28:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 22:28:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-27 22:28:33,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 22:28:33,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:33,484 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:33,484 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:28:33,486 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 22:28:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 22:28:33,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:28:33,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:28:33,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 29 states. [2022-04-27 22:28:33,486 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 29 states. [2022-04-27 22:28:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 22:28:33,487 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 22:28:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 22:28:33,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 22:28:33,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 22:28:33,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 22:28:33,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 22:28:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-27 22:28:33,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2022-04-27 22:28:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 22:28:33,488 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-27 22:28:33,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 22:28:33,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-27 22:28:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 22:28:33,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 22:28:33,489 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 22:28:33,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 22:28:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-27 22:28:33,699 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 22:28:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 22:28:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1059571457, now seen corresponding path program 2 times [2022-04-27 22:28:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 22:28:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155070830] [2022-04-27 22:28:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 22:28:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 22:28:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:28:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 22:28:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 22:28:33,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {1262#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {1252#true} is VALID [2022-04-27 22:28:33,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1252#true} is VALID [2022-04-27 22:28:33,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1252#true} {1252#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1252#true} is VALID [2022-04-27 22:28:33,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {1252#true} [78] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1262#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 22:28:33,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [80] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~SIZE~0_4 20000001) (= (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_4, #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] {1252#true} is VALID [2022-04-27 22:28:33,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1252#true} [83] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1252#true} is VALID [2022-04-27 22:28:33,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1252#true} {1252#true} [106] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1252#true} is VALID [2022-04-27 22:28:33,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {1252#true} [79] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1252#true} is VALID [2022-04-27 22:28:33,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {1252#true} [82] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {1252#true} is VALID [2022-04-27 22:28:33,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1252#true} [85] L19-->L21-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296))) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~i~0] {1257#(= main_~i~0 0)} is VALID [2022-04-27 22:28:33,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {1257#(= main_~i~0 0)} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {1258#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-27 22:28:33,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {1258#(and (<= main_~i~0 1) (<= 1 main_~i~0))} [89] L21-2-->L21-2: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 1)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_11 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[main_~i~0] {1259#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} is VALID [2022-04-27 22:28:33,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {1259#(and (not (<= (+ (div main_~i~0 4294967296) 1) 0)) (<= main_~i~0 2))} [88] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_10 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] {1260#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 2))} is VALID [2022-04-27 22:28:33,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 2))} [90] L21-3-->L25-2: Formula: (= v_main_~j~0_6 (let ((.cse0 (mod v_main_~i~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_7, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1261#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} is VALID [2022-04-27 22:28:33,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#(and (< 0 (+ (div main_~i~0 4294967296) 1)) (= (+ main_~j~0 (* (div main_~i~0 4294967296) 4294967296)) main_~i~0) (<= (+ main_~n~0 (* (div main_~i~0 4294967296) 4294967296)) (+ main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ 2147483647 (* (div main_~i~0 4294967296) 4294967296))))} [93] L25-2-->L25-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (< (mod v_main_~j~0_3 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~j~0=v_main_~j~0_3, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_~j~0] {1253#false} is VALID [2022-04-27 22:28:33,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {1253#false} [92] L25-2-->L25-3: Formula: (not (< (mod v_main_~j~0_1 4294967296) (mod v_main_~n~0_1 4294967296))) InVars {main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~j~0=v_main_~j~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[] {1253#false} is VALID [2022-04-27 22:28:33,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {1253#false} [94] L25-3-->L29-2: Formula: (= v_main_~j~0_4 v_main_~k~0_1) InVars {main_~j~0=v_main_~j~0_4} OutVars{main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0] {1253#false} is VALID [2022-04-27 22:28:33,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {1253#false} [96] L29-2-->L29-3: Formula: (not (< (mod v_main_~k~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~k~0=v_main_~k~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {1253#false} is VALID [2022-04-27 22:28:33,888 INFO L272 TraceCheckUtils]: 15: Hoare triple {1253#false} [98] L29-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= (mod (div (mod (+ v_main_~i~0_8 v_main_~j~0_7 v_main_~k~0_7) 4294967296) 3) 4294967296) (mod v_~SIZE~0_7 4294967296)) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_8, main_~k~0=v_main_~k~0_7, main_~j~0=v_main_~j~0_7} OutVars{~SIZE~0=v_~SIZE~0_7, __VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~j~0, main_~i~0] {1253#false} is VALID [2022-04-27 22:28:33,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {1253#false} [100] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1253#false} is VALID [2022-04-27 22:28:33,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {1253#false} [101] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1253#false} is VALID [2022-04-27 22:28:33,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {1253#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1253#false} is VALID [2022-04-27 22:28:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 22:28:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 22:28:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155070830] [2022-04-27 22:28:33,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155070830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 22:28:33,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456683736] [2022-04-27 22:28:33,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 22:28:33,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 22:28:33,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 22:28:33,890 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-27 22:28:33,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process