/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/vnew2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:27:07,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:27:07,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:27:07,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:27:07,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:27:07,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:27:07,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:27:07,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:27:07,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:27:07,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:27:07,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:27:07,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:27:07,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:27:07,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:27:07,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:27:07,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:27:07,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:27:07,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:27:07,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:27:07,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:27:07,338 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:27:07,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:27:07,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:27:07,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:27:07,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:27:07,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:27:07,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:27:07,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:27:07,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:27:07,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:27:07,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:27:07,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:27:07,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:27:07,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:27:07,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:27:07,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:27:07,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:27:07,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:27:07,355 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:27:07,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:27:07,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:27:07,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:27:07,357 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:27:07,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:27:07,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:27:07,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:27:07,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:27:07,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:27:07,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:27:07,386 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:27:07,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:27:07,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:27:07,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:27:07,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:27:07,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:27:07,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:27:07,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:27:07,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:27:07,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:27:07,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:27:07,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:27:07,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:27:07,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:27:07,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:27:07,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:27:07,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:27:07,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:27:07,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:27:07,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:27:07,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:27:07,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:27:07,390 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:27:07,391 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 01:27:07,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:27:07,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:27:07,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:27:07,644 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:27:07,644 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:27:07,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-15 01:27:07,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1989407/4a942a768dfe4675924160c810d0eee4/FLAGfc395de0c [2022-04-15 01:27:08,085 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:27:08,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew2.c [2022-04-15 01:27:08,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1989407/4a942a768dfe4675924160c810d0eee4/FLAGfc395de0c [2022-04-15 01:27:08,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1989407/4a942a768dfe4675924160c810d0eee4 [2022-04-15 01:27:08,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:27:08,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:27:08,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:27:08,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:27:08,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:27:08,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f884023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08, skipping insertion in model container [2022-04-15 01:27:08,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:27:08,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:27:08,270 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/vnew2.c[403,416] [2022-04-15 01:27:08,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:27:08,289 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:27:08,305 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/vnew2.c[403,416] [2022-04-15 01:27:08,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:27:08,320 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:27:08,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08 WrapperNode [2022-04-15 01:27:08,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:27:08,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:27:08,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:27:08,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:27:08,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:27:08,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:27:08,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:27:08,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:27:08,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:27:08,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:27:08,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 01:27:08,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 01:27:08,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:27:08,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:27:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:27:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 01:27:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:27:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:27:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:27:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 01:27:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 01:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:27:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:27:08,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:27:08,474 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:27:08,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:27:08,645 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:27:08,650 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:27:08,650 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 01:27:08,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:27:08 BoogieIcfgContainer [2022-04-15 01:27:08,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:27:08,653 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:27:08,653 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:27:08,654 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:27:08,656 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:27:08" (1/1) ... [2022-04-15 01:27:08,658 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:27:08,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:27:08 BasicIcfg [2022-04-15 01:27:08,675 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:27:08,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:27:08,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:27:08,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:27:08,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:27:08" (1/4) ... [2022-04-15 01:27:08,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a39b78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:27:08, skipping insertion in model container [2022-04-15 01:27:08,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:27:08" (2/4) ... [2022-04-15 01:27:08,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a39b78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:27:08, skipping insertion in model container [2022-04-15 01:27:08,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:27:08" (3/4) ... [2022-04-15 01:27:08,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a39b78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:27:08, skipping insertion in model container [2022-04-15 01:27:08,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:27:08" (4/4) ... [2022-04-15 01:27:08,682 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew2.cqvasr [2022-04-15 01:27:08,686 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:27:08,686 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:27:08,740 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:27:08,745 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 01:27:08,745 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:27:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:27:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:27:08,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:27:08,784 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:27:08,784 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:27:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:27:08,793 INFO L85 PathProgramCache]: Analyzing trace with hash -310389807, now seen corresponding path program 1 times [2022-04-15 01:27:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:27:08,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642649783] [2022-04-15 01:27:08,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:27:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:27:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:08,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:27:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:09,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {24#true} is VALID [2022-04-15 01:27:09,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:27:09,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:27:09,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:27:09,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {24#true} is VALID [2022-04-15 01:27:09,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:27:09,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:27:09,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-15 01:27:09,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {24#true} is VALID [2022-04-15 01:27:09,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {24#true} is VALID [2022-04-15 01:27:09,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [67] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:27:09,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:27:09,022 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {25#false} is VALID [2022-04-15 01:27:09,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-15 01:27:09,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:27:09,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-15 01:27:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:27:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:27:09,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642649783] [2022-04-15 01:27:09,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642649783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:27:09,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:27:09,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:27:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349330777] [2022-04-15 01:27:09,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:27:09,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-15 01:27:09,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:27:09,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:27:09,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:27:09,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:27:09,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:27:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:27:09,092 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:09,193 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 01:27:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:27:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-15 01:27:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:27:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-15 01:27:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-04-15 01:27:09,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-04-15 01:27:09,263 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-15 01:27:09,269 INFO L225 Difference]: With dead ends: 34 [2022-04-15 01:27:09,269 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 01:27:09,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:27:09,282 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 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-15 01:27:09,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:27:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 01:27:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 01:27:09,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:27:09,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,316 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,316 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:09,319 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:27:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:27:09,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:09,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:09,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:27:09,320 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 01:27:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:09,322 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 01:27:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:27:09,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:09,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:09,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:27:09,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:27:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 01:27:09,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-15 01:27:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:27:09,326 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 01:27:09,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 01:27:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 01:27:09,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:27:09,327 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:27:09,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:27:09,327 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:27:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:27:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash -281760656, now seen corresponding path program 1 times [2022-04-15 01:27:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:27:09,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648702023] [2022-04-15 01:27:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:27:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:27:09,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 01:27:09,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973963522] [2022-04-15 01:27:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:27:09,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:27:09,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:27:09,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:27:09,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 01:27:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:09,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 01:27:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:09,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:27:09,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-15 01:27:09,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {124#true} is VALID [2022-04-15 01:27:09,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-15 01:27:09,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-15 01:27:09,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {124#true} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {124#true} is VALID [2022-04-15 01:27:09,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {124#true} is VALID [2022-04-15 01:27:09,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#true} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {147#(= main_~i~0 0)} is VALID [2022-04-15 01:27:09,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {147#(= main_~i~0 0)} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {151#(not (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-15 01:27:09,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(not (< 0 (mod main_~n~0 4294967296)))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-15 01:27:09,538 INFO L272 TraceCheckUtils]: 9: Hoare triple {125#false} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {125#false} is VALID [2022-04-15 01:27:09,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#false} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {125#false} is VALID [2022-04-15 01:27:09,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {125#false} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-15 01:27:09,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {125#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {125#false} is VALID [2022-04-15 01:27:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:27:09,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 01:27:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:27:09,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648702023] [2022-04-15 01:27:09,540 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 01:27:09,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973963522] [2022-04-15 01:27:09,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973963522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:27:09,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:27:09,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 01:27:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772247662] [2022-04-15 01:27:09,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:27:09,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:27:09,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:27:09,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:27:09,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 01:27:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:27:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 01:27:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 01:27:09,568 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:09,619 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 01:27:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 01:27:09,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 01:27:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:27:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-15 01:27:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-04-15 01:27:09,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2022-04-15 01:27:09,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:27:09,650 INFO L225 Difference]: With dead ends: 21 [2022-04-15 01:27:09,650 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 01:27:09,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:27:09,655 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:27:09,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:27:09,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 01:27:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 01:27:09,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:27:09,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,664 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,664 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:09,669 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:27:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:27:09,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:09,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:09,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:27:09,672 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 01:27:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:09,674 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 01:27:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:27:09,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:09,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:09,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:27:09,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:27:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 01:27:09,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 01:27:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:27:09,682 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 01:27:09,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 01:27:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 01:27:09,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:27:09,683 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:27:09,711 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-15 01:27:09,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:27:09,909 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:27:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:27:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash 683692065, now seen corresponding path program 1 times [2022-04-15 01:27:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:27:09,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735151678] [2022-04-15 01:27:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:27:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:27:09,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 01:27:09,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962898880] [2022-04-15 01:27:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:27:09,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:27:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:27:09,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:27:09,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 01:27:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:09,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 01:27:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:09,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:27:10,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {252#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#true} is VALID [2022-04-15 01:27:10,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:10,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#(= ~SIZE~0 20000001)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:10,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#(= ~SIZE~0 20000001)} {252#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:10,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#(= ~SIZE~0 20000001)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:10,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(= ~SIZE~0 20000001)} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {260#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:10,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= ~SIZE~0 20000001)} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {276#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-15 01:27:10,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-15 01:27:10,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {284#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-15 01:27:10,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(and (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-15 01:27:10,544 INFO L272 TraceCheckUtils]: 10: Hoare triple {280#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:27:10,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:27:10,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-15 01:27:10,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-15 01:27:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:27:10,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:27:11,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {253#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-15 01:27:11,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {253#false} is VALID [2022-04-15 01:27:11,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {291#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:27:11,249 INFO L272 TraceCheckUtils]: 10: Hoare triple {311#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:27:11,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {311#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-15 01:27:11,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {315#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-15 01:27:11,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {319#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-15 01:27:11,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {323#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-15 01:27:11,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:11,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:11,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {252#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:11,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:11,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {327#(not (= (mod (mod 3 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:11,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {252#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {252#true} is VALID [2022-04-15 01:27:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:27:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:27:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735151678] [2022-04-15 01:27:11,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 01:27:11,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962898880] [2022-04-15 01:27:11,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962898880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:27:11,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:27:11,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2022-04-15 01:27:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938149910] [2022-04-15 01:27:11,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 01:27:11,268 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-15 01:27:11,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:27:11,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:27:11,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:27:11,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 01:27:11,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:27:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 01:27:11,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:27:11,306 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:27:17,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:27:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:21,161 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-15 01:27:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 01:27:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-04-15 01:27:21,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:27:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:27:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-15 01:27:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:27:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-15 01:27:21,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-04-15 01:27:23,081 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-15 01:27:23,082 INFO L225 Difference]: With dead ends: 28 [2022-04-15 01:27:23,082 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 01:27:23,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-04-15 01:27:23,084 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 01:27:23,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 01:27:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 01:27:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 01:27:23,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:27:23,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:23,101 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:23,101 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:23,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:23,103 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 01:27:23,103 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 01:27:23,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:23,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:23,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 01:27:23,104 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 01:27:23,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:27:23,105 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 01:27:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 01:27:23,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:27:23,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:27:23,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:27:23,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:27:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:27:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 01:27:23,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-04-15 01:27:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:27:23,107 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 01:27:23,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:27:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 01:27:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 01:27:23,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:27:23,108 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:27:23,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 01:27:23,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 01:27:23,315 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:27:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:27:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -958885712, now seen corresponding path program 2 times [2022-04-15 01:27:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:27:23,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885898861] [2022-04-15 01:27:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:27:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:27:23,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 01:27:23,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076419703] [2022-04-15 01:27:23,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:27:23,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:27:23,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:27:23,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:27:23,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 01:27:23,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:27:23,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:27:23,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 01:27:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:27:23,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:27:24,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 01:27:24,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:24,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {476#(= ~SIZE~0 20000001)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:24,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {476#(= ~SIZE~0 20000001)} {468#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:24,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {476#(= ~SIZE~0 20000001)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:24,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {476#(= ~SIZE~0 20000001)} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {476#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:27:24,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {476#(= ~SIZE~0 20000001)} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {492#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-15 01:27:24,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {496#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} is VALID [2022-04-15 01:27:24,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(and (= (+ main_~j~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~j~0 (- 3))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {500#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} is VALID [2022-04-15 01:27:24,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(and (= 3 (+ main_~k~0 (- 3))) (= main_~i~0 6) (= ~SIZE~0 20000001) (= main_~j~0 6))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {504#(and (= 3 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 6) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} is VALID [2022-04-15 01:27:24,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#(and (= 3 (+ main_~k~0 (- 6))) (= (+ main_~j~0 (- 3)) 6) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 3)) 6))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {508#(and (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 3 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-15 01:27:24,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(and (= (+ main_~i~0 (- 6)) 6) (= ~SIZE~0 20000001) (< (mod (+ main_~i~0 4294967293) 4294967296) (mod main_~n~0 4294967296)) (= 3 (+ (- 9) main_~k~0)) (= (+ main_~j~0 (- 6)) 6))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-15 01:27:24,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} is VALID [2022-04-15 01:27:24,096 INFO L272 TraceCheckUtils]: 13: Hoare triple {512#(and (= main_~j~0 12) (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:27:24,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:27:24,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 01:27:24,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 01:27:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:27:24,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:27:26,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 01:27:26,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {523#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {469#false} is VALID [2022-04-15 01:27:26,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {519#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {523#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:27:26,102 INFO L272 TraceCheckUtils]: 13: Hoare triple {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {519#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:27:26,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-15 01:27:26,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {539#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-15 01:27:26,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {546#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-15 01:27:26,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {550#(or (<= (div (+ (mod main_~i~0 4294967296) (* (- 1) (mod (+ main_~i~0 3) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))))} is VALID [2022-04-15 01:27:26,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {554#(or (<= (div (+ (mod (+ main_~i~0 3) 4294967296) (* (- 1) (mod (+ main_~i~0 6) 4294967296))) (- 4294967296)) 0) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-15 01:27:26,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {558#(or (<= (div (+ (mod (+ main_~i~0 6) 4294967296) (* (- 1) (mod (+ main_~i~0 9) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-15 01:27:26,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {562#(or (<= (div (+ (mod (+ main_~i~0 9) 4294967296) (* (- 1) (mod (+ main_~i~0 12) 4294967296))) (- 4294967296)) 0) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-15 01:27:26,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:26,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:26,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {468#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:26,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:26,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {566#(not (= (mod (mod 12 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:27:26,122 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {468#true} is VALID [2022-04-15 01:27:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:27:26,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:27:26,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885898861] [2022-04-15 01:27:26,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 01:27:26,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076419703] [2022-04-15 01:27:26,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076419703] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:27:26,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:27:26,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-15 01:27:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657108015] [2022-04-15 01:27:26,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 01:27:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 01:27:26,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:27:26,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:27:26,176 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-15 01:27:26,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 01:27:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:27:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 01:27:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-04-15 01:27:26,178 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:29:12,769 WARN L232 SmtUtils]: Spent 1.58m on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:29:15,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:29:17,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:29:22,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:29:24,355 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_main_~i~0 4294967296)) (.cse4 (mod (+ c_main_~i~0 3) 4294967296)) (.cse0 (mod (+ c_main_~i~0 6) 4294967296)) (.cse3 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (let ((.cse1 (mod (+ c_main_~i~0 9) 4294967296))) (or (<= (div (+ .cse0 (* (- 1) .cse1)) (- 4294967296)) 0) (let ((.cse2 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse2 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse1 .cse3) 4294967296) 0)) (= .cse2 .cse1))))) (or (let ((.cse5 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse4 .cse3) 4294967296) 0)) (= .cse5 .cse4) (= .cse5 (mod (+ 3 c_main_~k~0) 4294967296)))) (<= (div (+ .cse6 (* (- 1) .cse4)) (- 4294967296)) 0)) (or (< .cse6 (mod c_main_~n~0 4294967296)) (let ((.cse7 (mod c_main_~j~0 4294967296))) (and (= .cse7 (mod c_main_~k~0 4294967296)) (= .cse7 .cse6) (not (= 0 (mod (mod .cse6 .cse3) 4294967296)))))) (or (<= (div (+ (* (- 1) .cse0) .cse4) (- 4294967296)) 0) (let ((.cse8 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse8 .cse0) (= .cse8 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse0 .cse3) 4294967296) 0))))) (= 20000001 c_~SIZE~0))) is different from false [2022-04-15 01:29:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:29:48,747 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-15 01:29:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 01:29:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 01:29:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:29:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:29:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 45 transitions. [2022-04-15 01:29:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:29:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 45 transitions. [2022-04-15 01:29:48,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 45 transitions. [2022-04-15 01:29:53,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 43 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:29:53,982 INFO L225 Difference]: With dead ends: 40 [2022-04-15 01:29:53,982 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 01:29:53,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 122.9s TimeCoverageRelationStatistics Valid=165, Invalid=484, Unknown=5, NotChecked=48, Total=702 [2022-04-15 01:29:53,986 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-15 01:29:53,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 69 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 135 Invalid, 2 Unknown, 2 Unchecked, 8.2s Time] [2022-04-15 01:29:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 01:29:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 01:29:54,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:29:54,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:29:54,011 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:29:54,011 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:29:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:29:54,012 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 01:29:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 01:29:54,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:29:54,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:29:54,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 24 states. [2022-04-15 01:29:54,013 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 24 states. [2022-04-15 01:29:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:29:54,014 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 01:29:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 01:29:54,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:29:54,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:29:54,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:29:54,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:29:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:29:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 01:29:54,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2022-04-15 01:29:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:29:54,020 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 01:29:54,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:29:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 01:29:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 01:29:54,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:29:54,021 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:29:54,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 01:29:54,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:29:54,221 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:29:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:29:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 916237072, now seen corresponding path program 3 times [2022-04-15 01:29:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:29:54,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153716096] [2022-04-15 01:29:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:29:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:29:54,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 01:29:54,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149164265] [2022-04-15 01:29:54,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 01:29:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:29:54,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:29:54,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:29:54,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 01:29:54,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-15 01:29:54,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:29:54,513 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-15 01:29:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:29:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:29:55,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {758#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {758#true} is VALID [2022-04-15 01:29:55,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {766#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:29:55,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {766#(= ~SIZE~0 20000001)} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {766#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:29:55,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {766#(= ~SIZE~0 20000001)} {758#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {766#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:29:55,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {766#(= ~SIZE~0 20000001)} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {766#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:29:55,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {766#(= ~SIZE~0 20000001)} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {766#(= ~SIZE~0 20000001)} is VALID [2022-04-15 01:29:55,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {766#(= ~SIZE~0 20000001)} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {782#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} is VALID [2022-04-15 01:29:55,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {782#(and (= main_~i~0 main_~j~0) (= main_~k~0 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {786#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} is VALID [2022-04-15 01:29:55,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(and (= (+ main_~k~0 (- 3)) 0) (= ~SIZE~0 20000001) (= main_~k~0 main_~j~0) (= (+ main_~i~0 (- 3)) (+ main_~k~0 (- 3))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {790#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} is VALID [2022-04-15 01:29:55,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#(and (= main_~i~0 main_~k~0) (= main_~i~0 main_~j~0) (= ~SIZE~0 20000001) (= (+ main_~i~0 (- 6)) 0))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {794#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} is VALID [2022-04-15 01:29:55,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {794#(and (= (+ main_~j~0 (- 3)) 6) (= main_~k~0 9) (= ~SIZE~0 20000001) (= main_~i~0 9))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {798#(and (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} is VALID [2022-04-15 01:29:55,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {798#(and (= main_~k~0 12) (= main_~i~0 12) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 6))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {802#(and (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} is VALID [2022-04-15 01:29:55,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {802#(and (= 6 (+ (- 9) main_~j~0)) (= ~SIZE~0 20000001) (= (+ main_~k~0 (- 3)) 12) (= (+ main_~i~0 (- 3)) 12))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {806#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} is VALID [2022-04-15 01:29:55,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {806#(and (= main_~j~0 18) (= ~SIZE~0 20000001) (= main_~i~0 18) (= 12 (+ main_~k~0 (- 6))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {810#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)) (= main_~j~0 21))} is VALID [2022-04-15 01:29:55,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {810#(and (= main_~i~0 21) (= ~SIZE~0 20000001) (= 12 (+ (- 9) main_~k~0)) (= main_~j~0 21))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {814#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} is VALID [2022-04-15 01:29:55,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {814#(and (= ~SIZE~0 20000001) (= main_~j~0 24) (= (+ main_~i~0 (- 3)) 21) (= main_~k~0 24))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {818#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001))} is VALID [2022-04-15 01:29:55,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {818#(and (= (+ main_~k~0 (- 3)) 24) (= (+ main_~j~0 (- 3)) 24) (= main_~i~0 27) (= ~SIZE~0 20000001))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {822#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-15 01:29:55,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {822#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {826#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-15 01:29:55,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {826#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (not (< (mod main_~i~0 4294967296) (mod main_~n~0 4294967296))) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {822#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} is VALID [2022-04-15 01:29:55,207 INFO L272 TraceCheckUtils]: 19: Hoare triple {822#(and (= (+ main_~i~0 (- 3)) 27) (= (+ main_~k~0 (- 6)) 24) (= ~SIZE~0 20000001) (= (+ main_~j~0 (- 6)) 24))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {833#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:29:55,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:29:55,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {759#false} is VALID [2022-04-15 01:29:55,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {759#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {759#false} is VALID [2022-04-15 01:29:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:29:55,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:30:00,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {759#false} [77] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {759#false} is VALID [2022-04-15 01:30:00,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {837#(<= 1 __VERIFIER_assert_~cond)} [75] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {759#false} is VALID [2022-04-15 01:30:00,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 |__VERIFIER_assert_#in~cond|)} [74] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {837#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:30:00,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {853#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} [72] L27-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (let ((.cse0 (mod v_main_~j~0_6 4294967296)) (.cse1 (mod v_main_~i~0_7 4294967296))) (and (= .cse0 (mod v_main_~k~0_6 4294967296)) (= .cse1 .cse0) (not (= (mod (mod .cse1 (mod (+ v_~SIZE~0_7 2) 4294967296)) 4294967296) 0)))) 1 0)) InVars {~SIZE~0=v_~SIZE~0_7, main_~i~0=v_main_~i~0_7, main_~k~0=v_main_~k~0_6, main_~j~0=v_main_~j~0_6} 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] {833#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:30:00,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {857#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} [70] L21-3-->L27: Formula: (< 0 (mod v_main_~n~0_8 4294967296)) InVars {main_~n~0=v_main_~n~0_8} OutVars{main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {853#(and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)))} is VALID [2022-04-15 01:30:00,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {861#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} [68] L21-2-->L21-3: Formula: (not (< (mod v_main_~i~0_1 4294967296) (mod v_main_~n~0_2 4294967296))) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {857#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-15 01:30:00,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {865#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {861#(or (and (= (mod main_~i~0 4294967296) (mod main_~j~0 4294967296)) (= (mod main_~j~0 4294967296) (mod main_~k~0 4294967296)) (not (= (mod (mod (mod main_~i~0 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (- (mod main_~i~0 4294967296)) 4294967296)))} is VALID [2022-04-15 01:30:00,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {869#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {865#(or (and (= (mod (+ main_~j~0 3) 4294967296) (mod (+ main_~k~0 3) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 3) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 3) 4294967296) (mod (+ main_~j~0 3) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 3) 4294967296)) 4294967296)))} is VALID [2022-04-15 01:30:00,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {869#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 6) 4294967296)) 4294967296)) (and (= (mod (+ main_~k~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 6) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 6) 4294967296) (mod (+ main_~j~0 6) 4294967296))))} is VALID [2022-04-15 01:30:00,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {873#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 9) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 9) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 9) 4294967296) (mod (+ main_~k~0 9) 4294967296)) (= (mod (+ main_~i~0 9) 4294967296) (mod (+ main_~j~0 9) 4294967296))))} is VALID [2022-04-15 01:30:00,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {881#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {877#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 12) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 12) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~k~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296)) (= (mod (+ main_~i~0 12) 4294967296) (mod (+ main_~j~0 12) 4294967296))))} is VALID [2022-04-15 01:30:00,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {885#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {881#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 15) 4294967296)) 4294967296)) (and (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~k~0 15) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 15) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 15) 4294967296) (mod (+ main_~i~0 15) 4294967296))))} is VALID [2022-04-15 01:30:00,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {889#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {885#(or (<= 0 (div (* (- 1) (mod (+ main_~i~0 18) 4294967296)) 4294967296)) (and (not (= (mod (mod (mod (+ main_~i~0 18) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~k~0 18) 4294967296)) (= (mod (+ main_~j~0 18) 4294967296) (mod (+ main_~i~0 18) 4294967296))))} is VALID [2022-04-15 01:30:00,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {893#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {889#(or (and (= (mod (+ main_~j~0 21) 4294967296) (mod (+ main_~k~0 21) 4294967296)) (= (mod (+ main_~i~0 21) 4294967296) (mod (+ main_~j~0 21) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 21) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 21) 4294967296)) 4294967296)))} is VALID [2022-04-15 01:30:00,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {897#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {893#(or (and (= (mod (+ main_~j~0 24) 4294967296) (mod (+ main_~k~0 24) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 24) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~i~0 24) 4294967296) (mod (+ main_~j~0 24) 4294967296))) (<= 0 (div (* (- 1) (mod (+ main_~i~0 24) 4294967296)) 4294967296)))} is VALID [2022-04-15 01:30:00,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} [69] L21-2-->L21-2: Formula: (and (= v_main_~i~0_2 (+ v_main_~i~0_3 3)) (= v_main_~j~0_1 (+ v_main_~j~0_2 3)) (= v_main_~k~0_1 (+ v_main_~k~0_2 3)) (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_3 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {897#(or (<= 0 (div (* (mod (+ main_~i~0 27) 4294967296) (- 1)) 4294967296)) (and (= (mod (+ main_~i~0 27) 4294967296) (mod (+ main_~j~0 27) 4294967296)) (not (= (mod (mod (mod (+ main_~i~0 27) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0)) (= (mod (+ main_~j~0 27) 4294967296) (mod (+ main_~k~0 27) 4294967296))))} is VALID [2022-04-15 01:30:00,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [65] L19-->L21-2: Formula: (and (= v_main_~k~0_4 0) (<= (mod v_main_~n~0_9 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~i~0_5 v_main_~j~0_4) (= v_main_~j~0_4 v_main_~k~0_4)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_9} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_4, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~k~0, main_~j~0, main_~i~0] {901#(or (<= 0 (div (* (- 1) (mod (+ 30 main_~i~0) 4294967296)) 4294967296)) (and (= (mod (+ 30 main_~k~0) 4294967296) (mod (+ 30 main_~j~0) 4294967296)) (= (mod (+ 30 main_~j~0) 4294967296) (mod (+ 30 main_~i~0) 4294967296)) (not (= 0 (mod (mod (mod (+ 30 main_~i~0) 4294967296) (mod (+ ~SIZE~0 2) 4294967296)) 4294967296)))))} is VALID [2022-04-15 01:30:00,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [62] mainENTRY-->L19: Formula: (= v_main_~n~0_4 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~n~0=v_main_~n~0_4, main_~k~0=v_main_~k~0_3, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~j~0, main_~i~0, main_~n~0] {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:30:00,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [59] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:30:00,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} {758#true} [80] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:30:00,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} [63] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:30:00,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {758#true} [60] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 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] {905#(not (= (mod (mod 30 (mod (+ ~SIZE~0 2) 4294967296)) 4294967296) 0))} is VALID [2022-04-15 01:30:00,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {758#true} [58] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {758#true} is VALID [2022-04-15 01:30:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:30:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:30:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153716096] [2022-04-15 01:30:00,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 01:30:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149164265] [2022-04-15 01:30:00,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149164265] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:30:00,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 01:30:00,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2022-04-15 01:30:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735326016] [2022-04-15 01:30:00,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 01:30:00,935 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-04-15 01:30:00,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:30:00,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:30:01,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:30:01,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 01:30:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:30:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 01:30:01,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2022-04-15 01:30:01,008 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 01:30:03,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_main_~j~0 4294967296)) (.cse22 (mod c_main_~i~0 4294967296)) (.cse1 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (let ((.cse0 (mod (+ c_main_~i~0 18) 4294967296))) (or (<= 0 (div (* (- 1) .cse0) 4294967296)) (let ((.cse2 (mod (+ c_main_~j~0 18) 4294967296))) (and (not (= (mod (mod .cse0 .cse1) 4294967296) 0)) (= .cse0 .cse2) (= .cse2 (mod (+ 18 c_main_~k~0) 4294967296)))))) (let ((.cse4 (mod (+ c_main_~i~0 27) 4294967296))) (or (let ((.cse3 (mod (+ c_main_~j~0 27) 4294967296))) (and (= .cse3 .cse4) (= (mod (+ 27 c_main_~k~0) 4294967296) .cse3) (not (= (mod (mod .cse4 .cse1) 4294967296) 0)))) (<= 0 (div (* (- 1) .cse4) 4294967296)))) (let ((.cse5 (mod (+ c_main_~i~0 6) 4294967296))) (or (<= 0 (div (* (- 1) .cse5) 4294967296)) (let ((.cse6 (mod (+ 6 c_main_~j~0) 4294967296))) (and (= .cse6 .cse5) (= .cse6 (mod (+ 6 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse5 .cse1) 4294967296) 0)))))) (let ((.cse7 (mod (+ c_main_~i~0 3) 4294967296))) (or (let ((.cse8 (mod (+ 3 c_main_~j~0) 4294967296))) (and (not (= (mod (mod .cse7 .cse1) 4294967296) 0)) (= .cse8 .cse7) (= .cse8 (mod (+ 3 c_main_~k~0) 4294967296)))) (<= 0 (div (* (- 1) .cse7) 4294967296)))) (let ((.cse9 (mod (+ c_main_~i~0 21) 4294967296))) (or (<= 0 (div (* (- 1) .cse9) 4294967296)) (let ((.cse10 (mod (+ 21 c_main_~j~0) 4294967296))) (and (= .cse10 (mod (+ 21 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse9 .cse1) 4294967296) 0)) (= .cse10 .cse9))))) (let ((.cse11 (mod (+ c_main_~i~0 24) 4294967296))) (or (<= 0 (div (* (- 1) .cse11) 4294967296)) (let ((.cse12 (mod (+ c_main_~j~0 24) 4294967296))) (and (= .cse12 (mod (+ c_main_~k~0 24) 4294967296)) (not (= (mod (mod .cse11 .cse1) 4294967296) 0)) (= .cse12 .cse11))))) (let ((.cse14 (mod (+ c_main_~i~0 9) 4294967296))) (or (let ((.cse13 (mod (+ 9 c_main_~j~0) 4294967296))) (and (= .cse13 (mod (+ 9 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse14 .cse1) 4294967296) 0)) (= .cse13 .cse14))) (<= 0 (div (* (- 1) .cse14) 4294967296)))) (= .cse15 (mod c_main_~k~0 4294967296)) (let ((.cse16 (mod (+ c_main_~i~0 30) 4294967296))) (or (<= 0 (div (* (- 1) .cse16) 4294967296)) (let ((.cse17 (mod (+ 30 c_main_~j~0) 4294967296))) (and (= .cse17 (mod (+ 30 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse16 .cse1) 4294967296) 0)) (= .cse16 .cse17))))) (= 20000001 c_~SIZE~0) (let ((.cse18 (mod (+ c_main_~i~0 15) 4294967296))) (or (<= 0 (div (* (- 1) .cse18) 4294967296)) (let ((.cse19 (mod (+ 15 c_main_~j~0) 4294967296))) (and (= .cse18 .cse19) (= .cse19 (mod (+ 15 c_main_~k~0) 4294967296)) (not (= (mod (mod .cse18 .cse1) 4294967296) 0)))))) (let ((.cse21 (mod (+ c_main_~i~0 12) 4294967296))) (or (let ((.cse20 (mod (+ c_main_~j~0 12) 4294967296))) (and (= .cse20 (mod (+ 12 c_main_~k~0) 4294967296)) (= .cse20 .cse21) (not (= (mod (mod .cse21 .cse1) 4294967296) 0)))) (<= 0 (div (* (- 1) .cse21) 4294967296)))) (= .cse15 .cse22) (not (= 0 (mod (mod .cse22 .cse1) 4294967296))))) is different from false [2022-04-15 01:33:13,164 WARN L232 SmtUtils]: Spent 2.71m on a formula simplification that was a NOOP. DAG size: 187 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:33:17,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:33:19,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:33:22,067 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:33:24,075 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:33:28,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:36:49,566 WARN L232 SmtUtils]: Spent 2.85m on a formula simplification that was a NOOP. DAG size: 192 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:36:51,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:36:55,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:36:57,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:37:00,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 01:37:02,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []