/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:49:01,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:49:01,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:49:01,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:49:01,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:49:01,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:49:01,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:49:01,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:49:01,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:49:01,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:49:01,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:49:01,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:49:01,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:49:01,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:49:01,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:49:01,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:49:01,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:49:01,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:49:01,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:49:01,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:49:01,551 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:49:01,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:49:01,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:49:01,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:49:01,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:49:01,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:49:01,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:49:01,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:49:01,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:49:01,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:49:01,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:49:01,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:49:01,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:49:01,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:49:01,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:49:01,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:49:01,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:49:01,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:49:01,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:49:01,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:49:01,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:49:01,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:49:01,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:49:01,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:49:01,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:49:01,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:49:01,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:49:01,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:49:01,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:49:01,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:49:01,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:49:01,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:49:01,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:49:01,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:49:01,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:49:01,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:49:01,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:49:01,578 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:49:01,578 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 17:49:01,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:49:01,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:49:01,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:49:01,775 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:49:01,775 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:49:01,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-07 17:49:01,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af377820/d6f9571889e944c3a285bdfbe9957938/FLAG6f0714258 [2022-04-07 17:49:02,197 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:49:02,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-07 17:49:02,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af377820/d6f9571889e944c3a285bdfbe9957938/FLAG6f0714258 [2022-04-07 17:49:02,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af377820/d6f9571889e944c3a285bdfbe9957938 [2022-04-07 17:49:02,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:49:02,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:49:02,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:49:02,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:49:02,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:49:02,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9f0ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02, skipping insertion in model container [2022-04-07 17:49:02,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:49:02,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:49:02,403 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/sumt6.c[403,416] [2022-04-07 17:49:02,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:49:02,434 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:49:02,442 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/sumt6.c[403,416] [2022-04-07 17:49:02,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:49:02,456 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:49:02,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02 WrapperNode [2022-04-07 17:49:02,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:49:02,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:49:02,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:49:02,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:49:02,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:49:02,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:49:02,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:49:02,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:49:02,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (1/1) ... [2022-04-07 17:49:02,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:49:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:49:02,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 17:49:02,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 17:49:02,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:49:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:49:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:49:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:49:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:49:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:49:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:49:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:49:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:49:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:49:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:49:02,593 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:49:02,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:49:09,241 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:49:09,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:49:09,249 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 17:49:09,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:49:09 BoogieIcfgContainer [2022-04-07 17:49:09,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:49:09,251 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:49:09,251 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:49:09,252 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:49:09,254 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:49:09" (1/1) ... [2022-04-07 17:49:09,256 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:49:09,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:49:09 BasicIcfg [2022-04-07 17:49:09,278 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:49:09,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:49:09,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:49:09,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:49:09,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:49:02" (1/4) ... [2022-04-07 17:49:09,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50710c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:49:09, skipping insertion in model container [2022-04-07 17:49:09,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:49:02" (2/4) ... [2022-04-07 17:49:09,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50710c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:49:09, skipping insertion in model container [2022-04-07 17:49:09,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:49:09" (3/4) ... [2022-04-07 17:49:09,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50710c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:49:09, skipping insertion in model container [2022-04-07 17:49:09,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:49:09" (4/4) ... [2022-04-07 17:49:09,284 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.cJordan [2022-04-07 17:49:09,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:49:09,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:49:09,320 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:49:09,325 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:49:09,325 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:49:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:49:09,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:49:09,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:09,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:09,344 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2096714442, now seen corresponding path program 1 times [2022-04-07 17:49:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:09,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933367204] [2022-04-07 17:49:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:09,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-07 17:49:09,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:49:09,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:49:09,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:09,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {29#true} is VALID [2022-04-07 17:49:09,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:49:09,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:49:09,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:49:09,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {29#true} is VALID [2022-04-07 17:49:09,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-07 17:49:09,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} [88] L21-2-->L21-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 17:49:09,566 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {30#false} is VALID [2022-04-07 17:49:09,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30#false} is VALID [2022-04-07 17:49:09,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 17:49:09,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-07 17:49:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:49:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:09,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933367204] [2022-04-07 17:49:09,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933367204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:49:09,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:49:09,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:49:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959644231] [2022-04-07 17:49:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:49:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 17:49:09,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:49:09,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:09,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:09,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:49:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:49:09,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:49:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:49:09,624 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:16,212 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 17:49:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:49:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 17:49:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:49:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-07 17:49:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-07 17:49:16,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-07 17:49:16,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:16,283 INFO L225 Difference]: With dead ends: 26 [2022-04-07 17:49:16,283 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 17:49:16,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:49:16,289 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:49:16,290 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:49:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 17:49:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 17:49:16,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:49:16,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-07 17:49:16,311 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-07 17:49:16,311 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-07 17:49:16,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:16,318 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-07 17:49:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 17:49:16,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:16,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:16,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 19 states. [2022-04-07 17:49:16,321 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 19 states. [2022-04-07 17:49:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:16,324 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-07 17:49:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 17:49:16,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:16,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:16,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:49:16,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:49:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-07 17:49:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-07 17:49:16,336 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-07 17:49:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:49:16,337 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-07 17:49:16,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-07 17:49:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:49:16,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:16,337 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:16,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:49:16,338 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2097637963, now seen corresponding path program 1 times [2022-04-07 17:49:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528554157] [2022-04-07 17:49:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:16,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {120#true} is VALID [2022-04-07 17:49:16,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 17:49:16,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 17:49:16,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:16,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {120#true} is VALID [2022-04-07 17:49:16,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 17:49:16,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 17:49:16,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-07 17:49:16,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {125#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:16,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {125#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:16,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {125#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:16,674 INFO L272 TraceCheckUtils]: 8: Hoare triple {125#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:49:16,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:49:16,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-07 17:49:16,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {121#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#false} is VALID [2022-04-07 17:49:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:49:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:16,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528554157] [2022-04-07 17:49:16,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528554157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:49:16,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:49:16,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:49:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260983236] [2022-04-07 17:49:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:49:16,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 17:49:16,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:49:16,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:16,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:16,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:49:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:49:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:49:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:49:16,692 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:18,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:27,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:31,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:36,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:36,459 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-07 17:49:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:49:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-07 17:49:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:49:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 17:49:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-07 17:49:36,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-07 17:49:36,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:36,496 INFO L225 Difference]: With dead ends: 24 [2022-04-07 17:49:36,496 INFO L226 Difference]: Without dead ends: 21 [2022-04-07 17:49:36,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-07 17:49:36,497 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-07 17:49:36,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 8.5s Time] [2022-04-07 17:49:36,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-07 17:49:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-07 17:49:36,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:49:36,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,500 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,500 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:36,501 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-07 17:49:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 17:49:36,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:36,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:36,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 21 states. [2022-04-07 17:49:36,502 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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 21 states. [2022-04-07 17:49:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:49:36,503 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-07 17:49:36,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-07 17:49:36,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:49:36,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:49:36,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:49:36,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:49:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-07 17:49:36,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-07 17:49:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:49:36,505 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-07 17:49:36,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 17:49:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 17:49:36,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:49:36,506 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:49:36,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:49:36,506 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:49:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:49:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1607843865, now seen corresponding path program 1 times [2022-04-07 17:49:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:49:36,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267126743] [2022-04-07 17:49:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:49:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:49:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:37,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {223#true} is VALID [2022-04-07 17:49:37,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223#true} {223#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:49:37,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {223#true} is VALID [2022-04-07 17:49:37,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {229#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {230#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v2~0)) (<= 1 main_~v2~0) (<= main_~v2~0 1) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {231#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#(and (or (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (and (<= main_~v2~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v2~0)))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {232#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,022 INFO L272 TraceCheckUtils]: 11: Hoare triple {232#(and (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296))) (< (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0 1)) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v2~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {233#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:49:37,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {233#(not (= |__VERIFIER_assert_#in~cond| 0))} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {234#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:49:37,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#(not (= __VERIFIER_assert_~cond 0))} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:49:37,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:49:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:49:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:49:37,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267126743] [2022-04-07 17:49:37,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267126743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:49:37,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176455016] [2022-04-07 17:49:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:49:37,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:49:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:49:37,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:49:37,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 17:49:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:37,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-07 17:49:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:49:37,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:49:37,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {223#true} is VALID [2022-04-07 17:49:37,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:37,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {267#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:49:37,491 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:49:37,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:49:37,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:49:37,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:49:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:49:37,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:49:37,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:49:37,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {278#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {224#false} is VALID [2022-04-07 17:49:37,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {278#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:49:37,727 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {274#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:49:37,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:49:37,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:49:39,843 WARN L290 TraceCheckUtils]: 8: Hoare triple {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {301#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:49:39,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:49:39,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:49:39,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {294#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:49:39,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:39,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:39,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:39,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {223#true} is VALID [2022-04-07 17:49:39,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-07 17:49:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:49:39,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176455016] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:49:39,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:49:39,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-07 17:49:39,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431599632] [2022-04-07 17:49:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:49:39,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 17:49:39,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:49:39,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:41,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:49:41,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:49:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:49:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:49:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-07 17:49:41,976 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:49:44,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:46,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:52,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:49:54,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:05,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:07,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:12,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:12,251 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-07 17:50:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:50:12,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-07 17:50:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:50:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-07 17:50:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-07 17:50:12,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-07 17:50:14,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:14,397 INFO L225 Difference]: With dead ends: 26 [2022-04-07 17:50:14,397 INFO L226 Difference]: Without dead ends: 23 [2022-04-07 17:50:14,397 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-07 17:50:14,398 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-04-07 17:50:14,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 7 Unknown, 0 Unchecked, 14.7s Time] [2022-04-07 17:50:14,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-07 17:50:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-07 17:50:14,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:50:14,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:14,400 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:14,400 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:14,401 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 17:50:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 17:50:14,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:14,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:14,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 17:50:14,402 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-07 17:50:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:14,405 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-07 17:50:14,405 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-07 17:50:14,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:14,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:14,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:50:14,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:50:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-07 17:50:14,407 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-07 17:50:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:50:14,407 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-07 17:50:14,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-07 17:50:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 17:50:14,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:50:14,408 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:50:14,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 17:50:14,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:14,616 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:50:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:50:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1132300265, now seen corresponding path program 1 times [2022-04-07 17:50:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:50:14,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896171670] [2022-04-07 17:50:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:50:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:50:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:14,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:14,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:14,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {427#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:14,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {435#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:50:14,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:14,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:14,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {427#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:14,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {432#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:14,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {433#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:14,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {434#(= main_~l~0 0)} is VALID [2022-04-07 17:50:14,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {434#(= main_~l~0 0)} is VALID [2022-04-07 17:50:14,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(= main_~l~0 0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 17:50:14,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#false} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {428#false} is VALID [2022-04-07 17:50:14,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {428#false} is VALID [2022-04-07 17:50:14,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 17:50:14,893 INFO L272 TraceCheckUtils]: 12: Hoare triple {428#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {428#false} is VALID [2022-04-07 17:50:14,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {428#false} is VALID [2022-04-07 17:50:14,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 17:50:14,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 17:50:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:50:14,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:50:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896171670] [2022-04-07 17:50:14,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896171670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:50:14,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:50:14,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:50:14,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439472985] [2022-04-07 17:50:14,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:50:14,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 17:50:14,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:50:14,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:17,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:17,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 17:50:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:50:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 17:50:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 17:50:17,082 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:25,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:30,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:32,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:38,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:38,996 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 17:50:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:50:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-07 17:50:38,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:50:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-07 17:50:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-07 17:50:38,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-07 17:50:41,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:41,207 INFO L225 Difference]: With dead ends: 25 [2022-04-07 17:50:41,207 INFO L226 Difference]: Without dead ends: 25 [2022-04-07 17:50:41,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-07 17:50:41,208 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:50:41,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 30 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-04-07 17:50:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-07 17:50:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-07 17:50:41,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:50:41,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:41,212 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:41,212 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:41,213 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 17:50:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 17:50:41,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:41,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:41,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 25 states. [2022-04-07 17:50:41,214 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 25 states. [2022-04-07 17:50:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:50:41,215 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-07 17:50:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-07 17:50:41,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:50:41,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:50:41,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:50:41,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:50:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-07 17:50:41,216 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-07 17:50:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:50:41,217 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-07 17:50:41,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-07 17:50:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 17:50:41,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:50:41,217 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:50:41,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 17:50:41,218 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:50:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:50:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash -932165961, now seen corresponding path program 1 times [2022-04-07 17:50:41,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:50:41,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784658745] [2022-04-07 17:50:41,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:41,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:50:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:41,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:50:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:41,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:41,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:41,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {542#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:41,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:50:41,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:41,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:50:41,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {552#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {542#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:41,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:41,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {548#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:50:41,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {548#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {549#(= main_~l~0 0)} is VALID [2022-04-07 17:50:41,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {549#(= main_~l~0 0)} is VALID [2022-04-07 17:50:41,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {549#(= main_~l~0 0)} is VALID [2022-04-07 17:50:41,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {549#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {550#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 17:50:41,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {550#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {550#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 17:50:41,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {550#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 17:50:41,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {550#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {543#false} is VALID [2022-04-07 17:50:41,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {543#false} is VALID [2022-04-07 17:50:41,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {543#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:41,525 INFO L272 TraceCheckUtils]: 15: Hoare triple {543#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {543#false} is VALID [2022-04-07 17:50:41,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {543#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {543#false} is VALID [2022-04-07 17:50:41,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {543#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:41,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {543#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:50:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:50:41,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784658745] [2022-04-07 17:50:41,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784658745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:41,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040374993] [2022-04-07 17:50:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:50:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:50:41,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:50:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 17:50:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:41,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 17:50:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:50:41,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:50:41,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:41,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {542#true} is VALID [2022-04-07 17:50:41,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:41,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:41,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:42,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {571#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {571#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {571#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {571#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {581#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {585#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {585#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {585#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {585#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {585#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:50:42,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {585#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {595#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:50:42,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {595#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {599#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-07 17:50:42,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {599#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {599#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} is VALID [2022-04-07 17:50:42,011 INFO L272 TraceCheckUtils]: 15: Hoare triple {599#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:42,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:42,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:42,013 INFO L290 TraceCheckUtils]: 18: Hoare triple {543#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:50:42,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:50:42,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {543#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:42,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {543#false} is VALID [2022-04-07 17:50:42,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {606#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:50:42,274 INFO L272 TraceCheckUtils]: 15: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:50:42,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:42,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {633#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:44,382 WARN L290 TraceCheckUtils]: 12: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {633#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:50:44,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:44,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:44,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {633#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:46,515 WARN L290 TraceCheckUtils]: 8: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {633#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:50:46,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:46,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:46,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {626#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:50:46,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:46,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:46,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:46,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {542#true} is VALID [2022-04-07 17:50:46,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-07 17:50:46,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 17:50:46,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040374993] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:50:46,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:50:46,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-07 17:50:46,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7519352] [2022-04-07 17:50:46,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:50:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 17:50:46,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:50:46,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:50,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:50:50,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:50:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:50:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:50:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-07 17:50:50,768 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:50:52,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:55,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:50:57,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:03,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:05,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:10,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:10,318 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-07 17:51:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:51:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 17:51:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-07 17:51:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:10,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-07 17:51:10,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-07 17:51:14,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 32 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:14,570 INFO L225 Difference]: With dead ends: 31 [2022-04-07 17:51:14,570 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 17:51:14,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-07 17:51:14,570 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:14,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 6 Unknown, 0 Unchecked, 12.6s Time] [2022-04-07 17:51:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 17:51:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-07 17:51:14,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:14,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:14,573 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:14,573 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,574 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 17:51:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 17:51:14,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:14,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:14,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-07 17:51:14,575 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-07 17:51:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:14,579 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-07 17:51:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-07 17:51:14,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:14,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:14,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:14,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-07 17:51:14,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-07 17:51:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:14,582 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-07 17:51:14,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-07 17:51:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 17:51:14,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:14,582 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:51:14,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 17:51:14,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:14,793 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1043545585, now seen corresponding path program 1 times [2022-04-07 17:51:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:14,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452987781] [2022-04-07 17:51:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:51:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:14,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {796#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {789#true} is VALID [2022-04-07 17:51:14,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:14,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {789#true} {789#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:14,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {789#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {796#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:51:14,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {789#true} is VALID [2022-04-07 17:51:14,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:14,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:14,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:14,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {794#(= main_~l~0 0)} is VALID [2022-04-07 17:51:14,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {794#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {794#(= main_~l~0 0)} is VALID [2022-04-07 17:51:14,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {794#(= main_~l~0 0)} is VALID [2022-04-07 17:51:14,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {794#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {794#(= main_~l~0 0)} is VALID [2022-04-07 17:51:14,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {794#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:51:14,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:51:14,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:51:14,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-07 17:51:14,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {795#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {790#false} is VALID [2022-04-07 17:51:14,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {790#false} is VALID [2022-04-07 17:51:14,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {790#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:14,884 INFO L272 TraceCheckUtils]: 16: Hoare triple {790#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {790#false} is VALID [2022-04-07 17:51:14,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#false} is VALID [2022-04-07 17:51:14,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:14,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {790#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:51:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:14,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452987781] [2022-04-07 17:51:14,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452987781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:51:14,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638893085] [2022-04-07 17:51:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:14,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:14,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:14,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:51:14,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 17:51:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:14,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 17:51:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:14,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:15,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {789#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:15,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {789#true} is VALID [2022-04-07 17:51:15,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:15,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:15,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:15,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {815#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {815#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {815#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {815#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {815#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {815#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {825#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {825#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {842#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {846#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {846#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:15,302 INFO L272 TraceCheckUtils]: 16: Hoare triple {846#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {853#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:51:15,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {857#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:51:15,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {857#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:15,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {790#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:51:15,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:51:15,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {790#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:15,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {857#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#false} is VALID [2022-04-07 17:51:15,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {857#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:51:15,511 INFO L272 TraceCheckUtils]: 16: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {853#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:51:15,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:15,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {880#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:15,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {880#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 17:51:15,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:15,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:15,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:15,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {880#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:17,694 WARN L290 TraceCheckUtils]: 8: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {880#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:51:17,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:17,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:17,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {789#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {873#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:17,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:17,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {789#true} {789#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:17,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {789#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:17,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {789#true} is VALID [2022-04-07 17:51:17,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {789#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-07 17:51:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 17:51:17,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638893085] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:51:17,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:51:17,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 17:51:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453135064] [2022-04-07 17:51:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 17:51:17,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:17,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:19,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:19,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:51:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:19,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:51:19,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:51:19,833 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:21,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:24,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:26,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:28,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:30,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:32,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:34,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:36,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:37,143 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-07 17:51:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:51:37,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 17:51:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:51:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:51:37,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-07 17:51:39,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:39,309 INFO L225 Difference]: With dead ends: 38 [2022-04-07 17:51:39,309 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 17:51:39,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 17:51:39,310 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:39,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 8 Unknown, 0 Unchecked, 17.2s Time] [2022-04-07 17:51:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 17:51:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 17:51:39,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:39,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:39,313 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:39,313 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:39,314 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-07 17:51:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 17:51:39,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:39,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:39,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 35 states. [2022-04-07 17:51:39,315 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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 35 states. [2022-04-07 17:51:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:39,316 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-07 17:51:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 17:51:39,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:39,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:39,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:39,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 17:51:39,317 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-07 17:51:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:39,318 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 17:51:39,318 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 17:51:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 17:51:39,318 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:39,318 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:51:39,336 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-07 17:51:39,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:39,531 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash -58795524, now seen corresponding path program 1 times [2022-04-07 17:51:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:39,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525427147] [2022-04-07 17:51:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:39,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:51:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:39,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:51:39,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:51:39,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1069#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:51:39,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {1069#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1081#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:51:39,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:51:39,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:51:39,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1082#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1069#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:51:39,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:51:39,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1075#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:51:39,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {1075#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1076#(= main_~l~0 0)} is VALID [2022-04-07 17:51:39,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1076#(= main_~l~0 0)} is VALID [2022-04-07 17:51:39,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1076#(= main_~l~0 0)} is VALID [2022-04-07 17:51:39,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1077#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:51:39,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:51:39,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:51:39,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:51:39,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:51:42,028 WARN L290 TraceCheckUtils]: 14: Hoare triple {1078#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1079#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is UNKNOWN [2022-04-07 17:51:42,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1080#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-07 17:51:42,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {1080#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,032 INFO L272 TraceCheckUtils]: 17: Hoare triple {1070#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1070#false} is VALID [2022-04-07 17:51:42,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {1070#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1070#false} is VALID [2022-04-07 17:51:42,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1070#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:51:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525427147] [2022-04-07 17:51:42,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525427147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:51:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575890840] [2022-04-07 17:51:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:42,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:42,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:42,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:51:42,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 17:51:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:42,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 17:51:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:42,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:51:42,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1069#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:42,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1069#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1069#true} is VALID [2022-04-07 17:51:42,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1069#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:42,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1069#true} {1069#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:42,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1069#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:42,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1069#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1101#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {1101#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1101#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {1101#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1101#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1101#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1111#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {1111#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {1115#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1135#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1135#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1135#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:51:42,586 INFO L272 TraceCheckUtils]: 17: Hoare triple {1135#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:51:42,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:51:42,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {1070#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:51:42,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:51:42,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1070#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1070#false} is VALID [2022-04-07 17:51:42,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:51:42,843 INFO L272 TraceCheckUtils]: 17: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:51:42,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:42,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {1169#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:44,945 WARN L290 TraceCheckUtils]: 14: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {1169#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:51:44,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:44,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:44,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:44,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:44,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {1169#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:47,056 WARN L290 TraceCheckUtils]: 8: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1169#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:51:47,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:47,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:47,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {1069#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1162#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:51:47,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {1069#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:47,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1069#true} {1069#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:47,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1069#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:47,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {1069#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1069#true} is VALID [2022-04-07 17:51:47,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {1069#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-07 17:51:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 17:51:47,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575890840] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:51:47,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:51:47,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-07 17:51:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693093180] [2022-04-07 17:51:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:47,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 17:51:47,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:47,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:51,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:51,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:51:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:51:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-07 17:51:51,290 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:51:53,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:55,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:57,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:51:59,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:01,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:04,300 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-07 17:52:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:52:04,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 17:52:04,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:52:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:52:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:52:04,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-07 17:52:08,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 36 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:52:08,597 INFO L225 Difference]: With dead ends: 43 [2022-04-07 17:52:08,597 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 17:52:08,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:52:08,598 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-07 17:52:08,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-07 17:52:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 17:52:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-07 17:52:08,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:52:08,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:08,601 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:08,602 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:08,603 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 17:52:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-07 17:52:08,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:52:08,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:52:08,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 40 states. [2022-04-07 17:52:08,604 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 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 40 states. [2022-04-07 17:52:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:08,605 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 17:52:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-07 17:52:08,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:52:08,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:52:08,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:52:08,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:52:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 30 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-07 17:52:08,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-07 17:52:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:52:08,614 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-07 17:52:08,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-07 17:52:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 17:52:08,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:52:08,616 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:52:08,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 17:52:08,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:52:08,822 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:52:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:52:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2116274639, now seen corresponding path program 1 times [2022-04-07 17:52:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:52:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620401285] [2022-04-07 17:52:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:52:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:52:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:08,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:52:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:08,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {1384#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1377#true} is VALID [2022-04-07 17:52:08,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:08,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1377#true} {1377#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:08,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {1377#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1384#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:52:08,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {1384#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1377#true} is VALID [2022-04-07 17:52:08,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {1377#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:08,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1377#true} {1377#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:08,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:08,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {1377#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1382#(= main_~l~0 0)} is VALID [2022-04-07 17:52:08,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {1382#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1382#(= main_~l~0 0)} is VALID [2022-04-07 17:52:08,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {1382#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1382#(= main_~l~0 0)} is VALID [2022-04-07 17:52:08,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {1382#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1382#(= main_~l~0 0)} is VALID [2022-04-07 17:52:08,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {1382#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:08,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:08,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:08,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:08,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:08,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:08,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1383#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1378#false} is VALID [2022-04-07 17:52:08,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {1378#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1378#false} is VALID [2022-04-07 17:52:08,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {1378#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:08,902 INFO L272 TraceCheckUtils]: 18: Hoare triple {1378#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1378#false} is VALID [2022-04-07 17:52:08,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {1378#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1378#false} is VALID [2022-04-07 17:52:08,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {1378#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:08,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {1378#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:52:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:52:08,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620401285] [2022-04-07 17:52:08,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620401285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:52:08,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598805237] [2022-04-07 17:52:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:52:08,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:52:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:52:08,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:52:08,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 17:52:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:08,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 17:52:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:08,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:52:09,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {1377#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:09,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1377#true} is VALID [2022-04-07 17:52:09,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1377#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:09,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1377#true} {1377#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:09,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:09,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1377#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1403#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1403#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1403#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1413#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {1413#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {1417#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1436#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {1436#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1440#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {1440#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1440#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:09,389 INFO L272 TraceCheckUtils]: 18: Hoare triple {1440#(and (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:52:09,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:52:09,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:09,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {1378#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:52:09,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:52:09,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {1378#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:09,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {1451#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1378#false} is VALID [2022-04-07 17:52:09,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1447#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1451#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:52:09,612 INFO L272 TraceCheckUtils]: 18: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1447#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:52:09,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {1474#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {1474#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 17:52:09,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:09,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {1474#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:11,742 WARN L290 TraceCheckUtils]: 8: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1474#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:52:11,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:11,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:11,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {1377#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1467#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:11,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:11,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1377#true} {1377#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:11,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1377#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:11,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1377#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1377#true} is VALID [2022-04-07 17:52:11,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {1377#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-07 17:52:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-07 17:52:11,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598805237] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:52:11,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:52:11,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-07 17:52:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208309499] [2022-04-07 17:52:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:52:11,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-04-07 17:52:11,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:52:11,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:13,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:52:13,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:52:13,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:52:13,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:52:13,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-07 17:52:13,907 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:15,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:18,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:20,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:22,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:24,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:26,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:27,141 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2022-04-07 17:52:27,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:52:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-04-07 17:52:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:52:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 17:52:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 17:52:27,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-07 17:52:29,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:52:29,382 INFO L225 Difference]: With dead ends: 51 [2022-04-07 17:52:29,382 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 17:52:29,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-07 17:52:29,382 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-04-07 17:52:29,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 6 Unknown, 0 Unchecked, 13.1s Time] [2022-04-07 17:52:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 17:52:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-07 17:52:29,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:52:29,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:29,385 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:29,386 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:29,387 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 17:52:29,387 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 17:52:29,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:52:29,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:52:29,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 48 states. [2022-04-07 17:52:29,388 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 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 48 states. [2022-04-07 17:52:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:29,389 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-07 17:52:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 17:52:29,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:52:29,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:52:29,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:52:29,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:52:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-07 17:52:29,390 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-07 17:52:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:52:29,391 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-07 17:52:29,391 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-07 17:52:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 17:52:29,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:52:29,391 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:52:29,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 17:52:29,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:52:29,604 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:52:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:52:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1618193969, now seen corresponding path program 1 times [2022-04-07 17:52:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:52:29,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480936545] [2022-04-07 17:52:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:52:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:52:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:29,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:52:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:29,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {1730#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1722#true} is VALID [2022-04-07 17:52:29,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1722#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:29,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1722#true} {1722#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:29,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {1722#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1730#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:52:29,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {1730#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1722#true} is VALID [2022-04-07 17:52:29,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1722#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:29,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1722#true} {1722#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:29,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {1722#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:29,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1722#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1727#(= main_~l~0 0)} is VALID [2022-04-07 17:52:29,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1727#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1727#(= main_~l~0 0)} is VALID [2022-04-07 17:52:29,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {1727#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1727#(= main_~l~0 0)} is VALID [2022-04-07 17:52:29,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1727#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1727#(= main_~l~0 0)} is VALID [2022-04-07 17:52:29,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1727#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:29,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:29,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:29,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:29,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 17:52:29,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 17:52:29,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 17:52:29,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-07 17:52:29,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1723#false} is VALID [2022-04-07 17:52:29,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1723#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1723#false} is VALID [2022-04-07 17:52:29,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {1723#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:29,699 INFO L272 TraceCheckUtils]: 20: Hoare triple {1723#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1723#false} is VALID [2022-04-07 17:52:29,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1723#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1723#false} is VALID [2022-04-07 17:52:29,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {1723#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:29,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {1723#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:52:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:52:29,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480936545] [2022-04-07 17:52:29,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480936545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:52:29,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802532451] [2022-04-07 17:52:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:52:29,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:52:29,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:52:29,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:52:29,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 17:52:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:29,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 17:52:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:29,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:52:30,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {1722#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:30,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {1722#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1722#true} is VALID [2022-04-07 17:52:30,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {1722#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:30,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1722#true} {1722#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:30,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {1722#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:30,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {1722#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1749#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {1749#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1749#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {1749#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1749#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {1749#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1759#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {1759#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1763#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {1763#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1763#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {1763#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1763#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:30,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {1763#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1773#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {1773#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {1777#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1790#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {1790#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {1794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:30,277 INFO L272 TraceCheckUtils]: 20: Hoare triple {1794#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:52:30,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1805#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:52:30,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {1805#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:30,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {1723#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:52:30,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:52:30,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {1723#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:30,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {1805#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1723#false} is VALID [2022-04-07 17:52:30,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1805#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:52:30,560 INFO L272 TraceCheckUtils]: 20: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:52:30,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:30,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {1828#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:30,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [101] L27-->L31-2: Formula: (and (= v_main_~v4~0_1 (+ v_main_~v4~0_2 1)) (= (mod v_main_~l~0_2 4) 0)) InVars {main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_2} OutVars{main_~l~0=v_main_~l~0_2, main_~v4~0=v_main_~v4~0_1} AuxVars[] AssignedVars[main_~v4~0] {1828#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 17:52:30,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:30,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:30,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:30,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:32,700 WARN L290 TraceCheckUtils]: 12: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {1828#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:52:32,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:32,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:32,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:34,828 WARN L290 TraceCheckUtils]: 8: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {1828#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:52:34,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:34,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:34,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {1722#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {1821#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:52:34,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {1722#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:34,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1722#true} {1722#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:34,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {1722#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:34,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {1722#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {1722#true} is VALID [2022-04-07 17:52:34,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {1722#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-07 17:52:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 17:52:34,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802532451] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:52:34,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:52:34,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-07 17:52:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686679683] [2022-04-07 17:52:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:52:34,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 17:52:34,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:52:34,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:39,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 17 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:52:39,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:52:39,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:52:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:52:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-07 17:52:39,104 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:41,177 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:43,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:45,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:47,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:49,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:51,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:52:54,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:54,393 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2022-04-07 17:52:54,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:52:54,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-07 17:52:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:52:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:52:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:52:54,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-07 17:52:58,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 36 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:52:58,700 INFO L225 Difference]: With dead ends: 57 [2022-04-07 17:52:58,700 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 17:52:58,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-07 17:52:58,701 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:52:58,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 13.0s Time] [2022-04-07 17:52:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 17:52:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-07 17:52:58,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:52:58,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:58,711 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:58,711 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:58,712 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-07 17:52:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-07 17:52:58,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:52:58,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:52:58,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 54 states. [2022-04-07 17:52:58,713 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 54 states. [2022-04-07 17:52:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:52:58,714 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-07 17:52:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-07 17:52:58,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:52:58,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:52:58,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:52:58,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:52:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-07 17:52:58,716 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-07 17:52:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:52:58,716 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-07 17:52:58,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:52:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-07 17:52:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 17:52:58,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:52:58,717 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:52:58,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-07 17:52:58,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:52:58,920 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:52:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:52:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash 850752026, now seen corresponding path program 1 times [2022-04-07 17:52:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:52:58,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190355958] [2022-04-07 17:52:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:52:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:52:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:52:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:59,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {2108#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:52:59,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:52:59,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2097#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:52:59,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {2097#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2108#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:52:59,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {2108#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:52:59,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:52:59,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2109#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2097#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:52:59,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:52:59,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2103#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:52:59,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {2103#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2104#(= main_~l~0 0)} is VALID [2022-04-07 17:52:59,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2104#(= main_~l~0 0)} is VALID [2022-04-07 17:52:59,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2104#(= main_~l~0 0)} is VALID [2022-04-07 17:52:59,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:59,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:59,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:59,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:52:59,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {2105#(and (<= (+ (* (div (+ (* (- 1) main_~l~0) 2 (* (div (+ main_~l~0 1) 3) 3)) 2) 4294967296) 1) main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2106#(<= (+ 2 (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 3 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:52:59,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {2106#(<= (+ 2 (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 3 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296)) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:52:59,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:52:59,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:52:59,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:52:59,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {2107#(<= (+ 2 (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) 8589934592 (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {2098#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {2098#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L272 TraceCheckUtils]: 21: Hoare triple {2098#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {2098#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {2098#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {2098#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:52:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:52:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:52:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190355958] [2022-04-07 17:52:59,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190355958] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:52:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111469084] [2022-04-07 17:52:59,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:52:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:52:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:52:59,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:52:59,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 17:52:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:59,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 17:52:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:52:59,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:52:59,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {2097#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:52:59,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {2097#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2097#true} is VALID [2022-04-07 17:52:59,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {2097#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:52:59,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2097#true} {2097#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:52:59,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {2097#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:52:59,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {2097#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2128#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {2128#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2128#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {2128#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2128#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {2128#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2138#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {2138#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2142#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {2142#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2142#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {2142#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2142#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:52:59,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {2142#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2152#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {2152#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2172#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {2172#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2176#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2176#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2176#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:52:59,855 INFO L272 TraceCheckUtils]: 21: Hoare triple {2176#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:52:59,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:52:59,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {2187#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:52:59,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {2098#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:52:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:52:59,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:53:00,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {2098#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:53:00,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {2187#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2098#false} is VALID [2022-04-07 17:53:00,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:53:00,196 INFO L272 TraceCheckUtils]: 21: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:53:00,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:00,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {2210#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:02,332 WARN L290 TraceCheckUtils]: 18: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2210#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:02,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:02,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:02,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:02,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:02,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:04,469 WARN L290 TraceCheckUtils]: 12: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2210#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:04,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:04,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:04,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {2210#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:06,593 WARN L290 TraceCheckUtils]: 8: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2210#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:06,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:06,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:06,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {2097#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2203#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:06,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {2097#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:53:06,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2097#true} {2097#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:53:06,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2097#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:53:06,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {2097#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2097#true} is VALID [2022-04-07 17:53:06,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {2097#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-07 17:53:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 17:53:06,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111469084] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:53:06,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:53:06,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-07 17:53:06,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823116269] [2022-04-07 17:53:06,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:53:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 25 [2022-04-07 17:53:06,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:53:06,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:13,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 17 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 17:53:13,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:53:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:53:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:53:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:53:13,001 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:17,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:19,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:21,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:23,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:53:26,242 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2022-04-07 17:53:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:53:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 25 [2022-04-07 17:53:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:53:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:53:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-07 17:53:26,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-07 17:53:28,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:53:28,448 INFO L225 Difference]: With dead ends: 54 [2022-04-07 17:53:28,448 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 17:53:28,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-07 17:53:28,449 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-04-07 17:53:28,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 8.6s Time] [2022-04-07 17:53:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 17:53:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-07 17:53:28,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:53:28,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:28,452 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:28,452 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:53:28,454 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-07 17:53:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-07 17:53:28,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:53:28,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:53:28,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 51 states. [2022-04-07 17:53:28,455 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 51 states. [2022-04-07 17:53:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:53:28,458 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-07 17:53:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-07 17:53:28,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:53:28,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:53:28,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:53:28,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:53:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-07 17:53:28,460 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-07 17:53:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:53:28,460 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-07 17:53:28,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-07 17:53:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-07 17:53:28,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:53:28,462 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:53:28,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 17:53:28,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:53:28,669 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:53:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:53:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash 309895635, now seen corresponding path program 1 times [2022-04-07 17:53:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:53:28,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969689589] [2022-04-07 17:53:28,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:53:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:53:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:28,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:53:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:28,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {2477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:28,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:28,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2468#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2473#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:28,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {2468#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:53:28,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {2477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:28,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:28,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2468#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2473#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:28,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {2473#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2473#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:28,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {2473#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2474#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:28,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {2474#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2475#(= main_~l~0 0)} is VALID [2022-04-07 17:53:28,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {2475#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2475#(= main_~l~0 0)} is VALID [2022-04-07 17:53:28,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {2475#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2475#(= main_~l~0 0)} is VALID [2022-04-07 17:53:28,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2476#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 17:53:28,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2476#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 17:53:28,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2476#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} is VALID [2022-04-07 17:53:28,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(and (<= 1 main_~l~0) (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (* (div main_~l~0 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5)) 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2469#false} is VALID [2022-04-07 17:53:28,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {2469#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2469#false} is VALID [2022-04-07 17:53:28,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {2469#false} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {2469#false} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {2469#false} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {2469#false} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {2469#false} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {2469#false} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2469#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {2469#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L272 TraceCheckUtils]: 22: Hoare triple {2469#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {2469#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {2469#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {2469#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-07 17:53:28,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:53:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969689589] [2022-04-07 17:53:28,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969689589] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:53:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014927649] [2022-04-07 17:53:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:53:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:53:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:53:28,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:53:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 17:53:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:28,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 17:53:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:28,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:53:29,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {2468#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:29,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {2468#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2468#true} is VALID [2022-04-07 17:53:29,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {2468#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:29,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2468#true} {2468#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:29,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {2468#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:29,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {2468#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2497#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {2497#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2497#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {2497#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2497#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {2497#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2507#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {2507#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2511#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {2511#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2511#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {2511#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2511#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:29,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {2511#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2521#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {2525#(and (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2544#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-07 17:53:29,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {2544#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2548#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-07 17:53:29,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2548#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} is VALID [2022-04-07 17:53:29,495 INFO L272 TraceCheckUtils]: 22: Hoare triple {2548#(and (= (+ (- 1) main_~v3~0) 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:53:29,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {2555#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:53:29,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {2559#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:29,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {2469#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:53:29,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:53:29,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {2469#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:29,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {2559#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2469#false} is VALID [2022-04-07 17:53:29,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {2555#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:53:29,777 INFO L272 TraceCheckUtils]: 22: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:53:29,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {2582#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2582#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 17:53:29,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:29,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:31,900 WARN L290 TraceCheckUtils]: 12: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {2582#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:31,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:31,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:31,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2582#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:34,031 WARN L290 TraceCheckUtils]: 8: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2582#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:34,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:34,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:34,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {2468#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2575#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:34,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {2468#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:34,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2468#true} {2468#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:34,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {2468#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:34,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {2468#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2468#true} is VALID [2022-04-07 17:53:34,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {2468#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-07 17:53:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-07 17:53:34,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014927649] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:53:34,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:53:34,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 19 [2022-04-07 17:53:34,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083876421] [2022-04-07 17:53:34,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:53:34,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 26 [2022-04-07 17:53:34,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:53:34,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:36,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 17:53:36,185 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:53:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:53:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:53:36,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-07 17:53:36,186 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:38,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:40,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:42,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:44,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:47,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:53:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:53:47,358 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2022-04-07 17:53:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:53:47,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 26 [2022-04-07 17:53:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:53:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 17:53:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 17:53:47,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-07 17:53:51,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:53:51,720 INFO L225 Difference]: With dead ends: 56 [2022-04-07 17:53:51,720 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 17:53:51,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-07 17:53:51,721 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:53:51,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 11.0s Time] [2022-04-07 17:53:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 17:53:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-07 17:53:51,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:53:51,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:51,726 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:51,726 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:51,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:53:51,727 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-07 17:53:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-07 17:53:51,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:53:51,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:53:51,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 53 states. [2022-04-07 17:53:51,728 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 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 53 states. [2022-04-07 17:53:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:53:51,729 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-07 17:53:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-07 17:53:51,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:53:51,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:53:51,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:53:51,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:53:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-07 17:53:51,731 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-07 17:53:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:53:51,732 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-07 17:53:51,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:53:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-07 17:53:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 17:53:51,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:53:51,732 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:53:51,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 17:53:51,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 17:53:51,933 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:53:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:53:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash 522176238, now seen corresponding path program 1 times [2022-04-07 17:53:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:53:51,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587620438] [2022-04-07 17:53:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:53:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:53:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:53:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:52,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {2862#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:52,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:52,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2849#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2854#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:52,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {2849#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2862#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:53:52,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2862#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:52,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-07 17:53:52,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2863#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2849#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2854#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:52,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {2854#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2854#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:52,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {2854#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2855#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-07 17:53:52,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {2855#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2856#(= main_~l~0 0)} is VALID [2022-04-07 17:53:52,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {2856#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2856#(= main_~l~0 0)} is VALID [2022-04-07 17:53:52,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {2856#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2856#(= main_~l~0 0)} is VALID [2022-04-07 17:53:52,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {2856#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2857#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:53:52,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {2857#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:53:52,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:53:52,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:53:52,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-07 17:53:54,344 WARN L290 TraceCheckUtils]: 14: Hoare triple {2858#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2859#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is UNKNOWN [2022-04-07 17:53:54,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {2859#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-07 17:53:54,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {2860#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2861#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-07 17:53:54,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {2861#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:54,354 INFO L272 TraceCheckUtils]: 24: Hoare triple {2850#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2850#false} is VALID [2022-04-07 17:53:54,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {2850#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2850#false} is VALID [2022-04-07 17:53:54,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {2850#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:54,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {2850#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:53:54,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:53:54,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587620438] [2022-04-07 17:53:54,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587620438] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:53:54,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069915906] [2022-04-07 17:53:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:53:54,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:53:54,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:53:54,356 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:53:54,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 17:53:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:54,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 17:53:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:53:54,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:53:55,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {2849#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:55,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {2849#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2849#true} is VALID [2022-04-07 17:53:55,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2849#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:55,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2849#true} {2849#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:55,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2849#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:55,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2849#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2882#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {2882#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2882#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {2882#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2882#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {2882#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2892#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2892#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {2896#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2912#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {2912#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {2916#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2935#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {2935#(and (= main_~j~0 1) (= main_~l~0 2) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2939#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {2939#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2939#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-07 17:53:55,077 INFO L272 TraceCheckUtils]: 24: Hoare triple {2939#(and (= main_~j~0 1) (= main_~k~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2946#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:53:55,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {2946#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2950#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:53:55,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {2950#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:55,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {2850#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:53:55,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:53:55,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {2850#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:55,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {2950#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {2850#false} is VALID [2022-04-07 17:53:55,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {2946#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2950#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:53:55,437 INFO L272 TraceCheckUtils]: 24: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {2946#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:53:55,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {2973#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {2973#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 17:53:55,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:55,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2973#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:57,609 WARN L290 TraceCheckUtils]: 14: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {2973#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:57,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:57,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:57,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:57,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:57,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {2973#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:59,735 WARN L290 TraceCheckUtils]: 8: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {2973#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:53:59,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:59,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:59,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {2849#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {2966#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:53:59,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {2849#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:59,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2849#true} {2849#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:59,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {2849#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:59,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {2849#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {2849#true} is VALID [2022-04-07 17:53:59,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {2849#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-07 17:53:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 17:53:59,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069915906] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:53:59,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:53:59,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-07 17:53:59,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129923875] [2022-04-07 17:53:59,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:53:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2022-04-07 17:53:59,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:53:59,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:04,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:54:04,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:54:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:54:04,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:54:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-07 17:54:04,024 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:06,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:08,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:10,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:12,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:14,591 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:16,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:19,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:21,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:54:21,431 INFO L93 Difference]: Finished difference Result 69 states and 105 transitions. [2022-04-07 17:54:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:54:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 28 [2022-04-07 17:54:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:54:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 17:54:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-07 17:54:21,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-07 17:54:25,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 38 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 17:54:25,768 INFO L225 Difference]: With dead ends: 69 [2022-04-07 17:54:25,768 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 17:54:25,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-07 17:54:25,769 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-04-07 17:54:25,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 8 Unknown, 0 Unchecked, 17.3s Time] [2022-04-07 17:54:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 17:54:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-07 17:54:25,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:54:25,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:25,786 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:25,787 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:54:25,788 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-07 17:54:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-07 17:54:25,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:54:25,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:54:25,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 66 states. [2022-04-07 17:54:25,788 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 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 66 states. [2022-04-07 17:54:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:54:25,789 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-07 17:54:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-07 17:54:25,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:54:25,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:54:25,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:54:25,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:54:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 61 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-07 17:54:25,791 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-07 17:54:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:54:25,791 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-07 17:54:25,791 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-07 17:54:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 17:54:25,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:54:25,791 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:54:25,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-07 17:54:25,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:54:25,992 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:54:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:54:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2133946640, now seen corresponding path program 1 times [2022-04-07 17:54:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:54:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867303372] [2022-04-07 17:54:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:54:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:54:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:54:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:54:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:54:26,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {3320#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3311#true} is VALID [2022-04-07 17:54:26,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {3311#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3311#true} {3311#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {3311#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3320#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:54:26,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {3320#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3311#true} is VALID [2022-04-07 17:54:26,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {3311#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3311#true} {3311#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {3311#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {3311#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3316#(= main_~l~0 0)} is VALID [2022-04-07 17:54:26,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {3316#(= main_~l~0 0)} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3316#(= main_~l~0 0)} is VALID [2022-04-07 17:54:26,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {3316#(= main_~l~0 0)} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3316#(= main_~l~0 0)} is VALID [2022-04-07 17:54:26,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {3316#(= main_~l~0 0)} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3316#(= main_~l~0 0)} is VALID [2022-04-07 17:54:26,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {3316#(= main_~l~0 0)} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:54:26,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:54:26,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:54:26,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-07 17:54:26,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {3317#(and (<= 1 main_~l~0) (<= main_~l~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-07 17:54:26,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-07 17:54:26,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-07 17:54:26,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-07 17:54:26,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-07 17:54:26,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} is VALID [2022-04-07 17:54:26,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#(and (<= 2 main_~l~0) (<= main_~l~0 2))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-07 17:54:26,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-07 17:54:26,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-07 17:54:26,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-07 17:54:26,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-07 17:54:26,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} is VALID [2022-04-07 17:54:26,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {3319#(and (<= 3 main_~l~0) (<= (div main_~l~0 2) 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3312#false} is VALID [2022-04-07 17:54:26,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {3312#false} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3312#false} is VALID [2022-04-07 17:54:26,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {3312#false} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:26,094 INFO L272 TraceCheckUtils]: 28: Hoare triple {3312#false} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3312#false} is VALID [2022-04-07 17:54:26,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {3312#false} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3312#false} is VALID [2022-04-07 17:54:26,094 INFO L290 TraceCheckUtils]: 30: Hoare triple {3312#false} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:26,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {3312#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:54:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:54:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867303372] [2022-04-07 17:54:26,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867303372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:54:26,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310462336] [2022-04-07 17:54:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:54:26,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:54:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:54:26,096 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:54:26,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-07 17:54:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:54:26,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 17:54:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:54:26,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:54:26,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {3311#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {3311#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3311#true} is VALID [2022-04-07 17:54:26,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {3311#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3311#true} {3311#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {3311#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:26,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {3311#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3339#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {3339#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3339#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {3339#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3339#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {3339#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3349#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {3349#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3353#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {3353#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3353#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3353#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-07 17:54:26,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {3353#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3363#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {3363#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {3367#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3383#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {3387#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3406#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {3406#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3410#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {3410#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3410#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-07 17:54:26,799 INFO L272 TraceCheckUtils]: 28: Hoare triple {3410#(and (= 3 (+ (- 1) main_~l~0)) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:54:26,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {3417#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:54:26,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {3421#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:26,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {3312#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:54:26,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:54:27,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {3312#false} [103] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:27,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {3421#(<= 1 __VERIFIER_assert_~cond)} [99] L9-->L10: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {3312#false} is VALID [2022-04-07 17:54:27,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {3417#(<= 1 |__VERIFIER_assert_#in~cond|)} [95] __VERIFIER_assertENTRY-->L9: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3421#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:54:27,129 INFO L272 TraceCheckUtils]: 28: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [91] L21-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~l~0_17 4294967296) (mod (+ v_main_~v2~0_5 v_main_~v3~0_5 v_main_~v4~0_5 v_main_~i~0_5 v_main_~j~0_5 v_main_~k~0_5) 4294967296)) 1 0)) InVars {main_~l~0=v_main_~l~0_17, main_~v2~0=v_main_~v2~0_5, main_~k~0=v_main_~k~0_5, main_~v4~0=v_main_~v4~0_5, main_~j~0=v_main_~j~0_5, main_~i~0=v_main_~i~0_5, main_~v3~0=v_main_~v3~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~l~0, __VERIFIER_assert_#in~cond, main_~v2~0, main_~k~0, main_~v4~0, main_~j~0, main_~i~0, main_~v3~0] {3417#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:54:27,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [89] L21-2-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [108] L31-->L31-2: Formula: (and (= (+ v_main_~j~0_3 1) v_main_~j~0_2) (= (mod v_main_~l~0_7 2) 0)) InVars {main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_3} OutVars{main_~l~0=v_main_~l~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0] {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is VALID [2022-04-07 17:54:27,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [107] L29-->L31: Formula: (not (= (mod (mod (mod v_main_~l~0_6 4294967296) 3) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_6} OutVars{main_~l~0=v_main_~l~0_6} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:27,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:29,257 WARN L290 TraceCheckUtils]: 18: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [106] L29-->L31-2: Formula: (and (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) (= (mod (mod (mod v_main_~l~0_4 4294967296) 3) 4294967296) 0)) InVars {main_~i~0=v_main_~i~0_2, main_~l~0=v_main_~l~0_4} OutVars{main_~i~0=v_main_~i~0_1, main_~l~0=v_main_~l~0_4} AuxVars[] AssignedVars[main_~i~0] {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:54:29,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [102] L27-->L29: Formula: (not (= (mod v_main_~l~0_3 4) 0)) InVars {main_~l~0=v_main_~l~0_3} OutVars{main_~l~0=v_main_~l~0_3} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:29,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [98] L25-->L27: Formula: (not (= (mod (mod (mod v_main_~l~0_1 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_1} OutVars{main_~l~0=v_main_~l~0_1} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:29,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:29,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:29,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:31,388 WARN L290 TraceCheckUtils]: 12: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [97] L25-->L31-2: Formula: (and (= v_main_~v3~0_3 (+ v_main_~v3~0_4 1)) (= (mod (mod (mod v_main_~l~0_16 4294967296) 5) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_4} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_3} AuxVars[] AssignedVars[main_~v3~0] {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:54:31,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [93] L23-->L25: Formula: (not (= (mod (mod (mod v_main_~l~0_15 4294967296) 6) 4294967296) 0)) InVars {main_~l~0=v_main_~l~0_15} OutVars{main_~l~0=v_main_~l~0_15} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:31,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:31,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} [96] L31-2-->L21-2: Formula: (= (+ v_main_~l~0_10 1) v_main_~l~0_9) InVars {main_~l~0=v_main_~l~0_10} OutVars{main_~l~0=v_main_~l~0_9} AuxVars[] AssignedVars[main_~l~0] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:33,519 WARN L290 TraceCheckUtils]: 8: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [92] L23-->L31-2: Formula: (and (= v_main_~v2~0_3 (+ v_main_~v2~0_4 1)) (= (mod (mod (mod v_main_~l~0_14 4294967296) 6) 4294967296) 0)) InVars {main_~v2~0=v_main_~v2~0_4, main_~l~0=v_main_~l~0_14} OutVars{main_~v2~0=v_main_~v2~0_3, main_~l~0=v_main_~l~0_14} AuxVars[] AssignedVars[main_~v2~0] {3444#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod (+ main_~l~0 1) 4294967296))} is UNKNOWN [2022-04-07 17:54:33,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [90] L21-2-->L23: Formula: (< (mod v_main_~l~0_13 4294967296) (mod v_main_~n~0_6 4294967296)) InVars {main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} OutVars{main_~l~0=v_main_~l~0_13, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:33,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} [86] L20-->L21-2: Formula: (<= (mod v_main_~n~0_4 4294967296) (mod v_~SIZE~0_2 4294967296)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} OutVars{~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:33,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {3311#true} [83] mainENTRY-->L20: Formula: (and (= v_main_~v4~0_3 0) (= v_main_~j~0_1 0) (= v_main_~i~0_3 0) (= v_main_~l~0_5 0) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~k~0_1 0) (= v_main_~v3~0_1 0) (= v_main_~v2~0_1 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~l~0=v_main_~l~0_5, main_~v2~0=v_main_~v2~0_1, main_~v4~0=v_main_~v4~0_3, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_1, main_~i~0=v_main_~i~0_3, main_~v3~0=v_main_~v3~0_1, main_~n~0=v_main_~n~0_1} AuxVars[] AssignedVars[main_~l~0, main_#t~nondet4, main_~v2~0, main_~v4~0, main_~k~0, main_~j~0, main_~i~0, main_~v3~0, main_~n~0] {3437#(= (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) (mod main_~l~0 4294967296))} is VALID [2022-04-07 17:54:33,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {3311#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:33,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3311#true} {3311#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:33,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {3311#true} [84] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:33,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {3311#true} [81] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~SIZE~0=v_~SIZE~0_3, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, #NULL.base] {3311#true} is VALID [2022-04-07 17:54:33,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {3311#true} [79] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-07 17:54:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-07 17:54:33,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310462336] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:54:33,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:54:33,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 13] total 20 [2022-04-07 17:54:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092947966] [2022-04-07 17:54:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:54:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 32 [2022-04-07 17:54:33,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:54:33,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:39,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 17:54:39,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:54:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:54:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:54:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-07 17:54:39,942 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:41,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:44,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:48,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:50,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 17:54:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:54:50,920 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-07 17:54:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:54:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 32 [2022-04-07 17:54:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:54:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-07 17:54:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-07 17:54:50,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-07 17:54:57,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 20 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-07 17:54:57,373 INFO L225 Difference]: With dead ends: 64 [2022-04-07 17:54:57,373 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:54:57,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-04-07 17:54:57,373 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-07 17:54:57,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-04-07 17:54:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:54:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:54:57,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:54:57,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:54:57,374 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:54:57,374 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:54:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:54:57,375 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:54:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:54:57,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:54:57,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:54:57,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:54:57,375 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:54:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:54:57,375 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:54:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:54:57,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:54:57,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:54:57,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:54:57,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:54:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:54:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:54:57,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-07 17:54:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:54:57,376 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:54:57,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 17:54:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:54:57,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:54:57,378 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:54:57,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 17:54:57,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 17:54:57,581 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:54:57,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:54:57,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:54:57 BasicIcfg [2022-04-07 17:54:57,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:54:57,584 INFO L158 Benchmark]: Toolchain (without parser) took 355367.10ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 146.0MB in the beginning and 130.2MB in the end (delta: 15.8MB). Peak memory consumption was 116.5MB. Max. memory is 8.0GB. [2022-04-07 17:54:57,584 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:54:57,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.76ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 145.8MB in the beginning and 271.0MB in the end (delta: -125.3MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-07 17:54:57,584 INFO L158 Benchmark]: Boogie Preprocessor took 33.98ms. Allocated memory is still 302.0MB. Free memory was 271.0MB in the beginning and 269.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 17:54:57,585 INFO L158 Benchmark]: RCFGBuilder took 6758.89ms. Allocated memory is still 302.0MB. Free memory was 269.6MB in the beginning and 257.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 17:54:57,585 INFO L158 Benchmark]: IcfgTransformer took 27.07ms. Allocated memory is still 302.0MB. Free memory was 257.1MB in the beginning and 255.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:54:57,585 INFO L158 Benchmark]: TraceAbstraction took 348304.26ms. Allocated memory is still 302.0MB. Free memory was 255.0MB in the beginning and 130.2MB in the end (delta: 124.8MB). Peak memory consumption was 124.5MB. Max. memory is 8.0GB. [2022-04-07 17:54:57,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.76ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 145.8MB in the beginning and 271.0MB in the end (delta: -125.3MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.98ms. Allocated memory is still 302.0MB. Free memory was 271.0MB in the beginning and 269.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6758.89ms. Allocated memory is still 302.0MB. Free memory was 269.6MB in the beginning and 257.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 27.07ms. Allocated memory is still 302.0MB. Free memory was 257.1MB in the beginning and 255.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 348304.26ms. Allocated memory is still 302.0MB. Free memory was 255.0MB in the beginning and 130.2MB in the end (delta: 124.8MB). Peak memory consumption was 124.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 348.3s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 248.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 67 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 143.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 135.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 611 IncrementalHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 187 mSDtfsCounter, 611 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 364 SyntacticMatches, 36 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 55.7s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 8294 SizeOfPredicates, 10 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 140/307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:54:57,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...