/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-e106359-m [2022-04-14 19:58:05,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 19:58:05,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 19:58:05,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 19:58:05,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 19:58:05,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 19:58:05,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 19:58:05,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 19:58:05,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 19:58:05,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 19:58:05,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 19:58:05,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 19:58:05,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 19:58:05,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 19:58:05,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 19:58:05,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 19:58:05,591 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 19:58:05,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 19:58:05,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 19:58:05,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 19:58:05,596 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 19:58:05,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 19:58:05,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 19:58:05,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 19:58:05,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 19:58:05,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 19:58:05,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 19:58:05,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 19:58:05,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 19:58:05,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 19:58:05,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 19:58:05,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 19:58:05,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 19:58:05,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 19:58:05,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 19:58:05,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 19:58:05,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 19:58:05,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 19:58:05,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 19:58:05,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 19:58:05,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 19:58:05,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 19:58:05,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 19:58:05,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 19:58:05,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 19:58:05,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 19:58:05,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 19:58:05,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 19:58:05,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 19:58:05,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 19:58:05,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 19:58:05,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 19:58:05,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 19:58:05,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 19:58:05,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 19:58:05,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 19:58:05,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 19:58:05,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 19:58:05,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 19:58:05,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 19:58:05,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 19:58:05,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:58:05,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 19:58:05,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 19:58:05,623 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 19:58:05,623 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-14 19:58:05,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 19:58:05,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 19:58:05,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 19:58:05,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 19:58:05,825 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 19:58:05,826 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-14 19:58:05,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f594a8ca/a387988fc72c4ac58b8534912a451374/FLAGef5c16da6 [2022-04-14 19:58:06,240 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 19:58:06,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-14 19:58:06,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f594a8ca/a387988fc72c4ac58b8534912a451374/FLAGef5c16da6 [2022-04-14 19:58:06,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f594a8ca/a387988fc72c4ac58b8534912a451374 [2022-04-14 19:58:06,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 19:58:06,255 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 19:58:06,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 19:58:06,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 19:58:06,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 19:58:06,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e27a769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06, skipping insertion in model container [2022-04-14 19:58:06,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 19:58:06,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 19:58:06,374 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-14 19:58:06,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:58:06,393 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 19:58:06,408 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-14 19:58:06,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 19:58:06,445 INFO L208 MainTranslator]: Completed translation [2022-04-14 19:58:06,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06 WrapperNode [2022-04-14 19:58:06,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 19:58:06,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 19:58:06,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 19:58:06,447 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 19:58:06,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 19:58:06,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 19:58:06,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 19:58:06,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 19:58:06,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (1/1) ... [2022-04-14 19:58:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 19:58:06,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:58:06,518 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-14 19:58:06,526 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-14 19:58:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 19:58:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 19:58:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 19:58:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 19:58:06,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 19:58:06,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 19:58:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 19:58:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 19:58:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 19:58:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 19:58:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 19:58:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 19:58:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 19:58:06,547 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 19:58:06,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 19:58:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 19:58:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 19:58:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 19:58:06,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 19:58:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 19:58:06,599 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 19:58:06,600 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 19:58:13,295 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 19:58:13,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 19:58:13,301 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 19:58:13,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:58:13 BoogieIcfgContainer [2022-04-14 19:58:13,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 19:58:13,302 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 19:58:13,302 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 19:58:13,311 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 19:58:13,314 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:58:13" (1/1) ... [2022-04-14 19:58:13,315 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 19:58:13,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:58:13 BasicIcfg [2022-04-14 19:58:13,335 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 19:58:13,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 19:58:13,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 19:58:13,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 19:58:13,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 07:58:06" (1/4) ... [2022-04-14 19:58:13,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdbf131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:58:13, skipping insertion in model container [2022-04-14 19:58:13,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 07:58:06" (2/4) ... [2022-04-14 19:58:13,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdbf131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 07:58:13, skipping insertion in model container [2022-04-14 19:58:13,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 07:58:13" (3/4) ... [2022-04-14 19:58:13,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdbf131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 07:58:13, skipping insertion in model container [2022-04-14 19:58:13,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 07:58:13" (4/4) ... [2022-04-14 19:58:13,340 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.cJordan [2022-04-14 19:58:13,343 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 19:58:13,343 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 19:58:13,371 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 19:58:13,375 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-14 19:58:13,375 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 19:58:13,386 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-14 19:58:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:58:13,390 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:58:13,391 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:58:13,391 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:58:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:58:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2096714442, now seen corresponding path program 1 times [2022-04-14 19:58:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:58:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554073778] [2022-04-14 19:58:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:58:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:58:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:58:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:13,532 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-14 19:58:13,532 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-14 19:58:13,533 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-14 19:58:13,534 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-14 19:58:13,536 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-14 19:58:13,537 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-14 19:58:13,537 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-14 19:58:13,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-14 19:58:13,538 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-14 19:58:13,539 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-14 19:58:13,540 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-14 19:58:13,540 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-14 19:58:13,541 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-14 19:58:13,541 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-14 19:58:13,542 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-14 19:58:13,542 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-14 19:58:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:58:13,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554073778] [2022-04-14 19:58:13,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554073778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:58:13,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:58:13,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 19:58:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433850304] [2022-04-14 19:58:13,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:58:13,550 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-14 19:58:13,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:58:13,553 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-14 19:58:13,567 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-14 19:58:13,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 19:58:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:58:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 19:58:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 19:58:13,587 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-14 19:58:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:20,208 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-14 19:58:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 19:58:20,208 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-14 19:58:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:58:20,209 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-14 19:58:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-14 19:58:20,215 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-14 19:58:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-14 19:58:20,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-14 19:58:20,259 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-14 19:58:20,265 INFO L225 Difference]: With dead ends: 26 [2022-04-14 19:58:20,265 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 19:58:20,267 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-14 19:58:20,270 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-14 19:58:20,270 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-14 19:58:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 19:58:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 19:58:20,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:58:20,290 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-14 19:58:20,290 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-14 19:58:20,291 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-14 19:58:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:20,298 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-14 19:58:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-14 19:58:20,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:20,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:58:20,299 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-14 19:58:20,300 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-14 19:58:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:20,303 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-14 19:58:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-14 19:58:20,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:20,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:58:20,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:58:20,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:58:20,304 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-14 19:58:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-14 19:58:20,315 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-14 19:58:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:58:20,315 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-14 19:58:20,315 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-14 19:58:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-14 19:58:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 19:58:20,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:58:20,316 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:58:20,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 19:58:20,316 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:58:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:58:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2097637963, now seen corresponding path program 1 times [2022-04-14 19:58:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:58:20,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259224214] [2022-04-14 19:58:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:58:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:58:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:58:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:20,640 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-14 19:58:20,641 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-14 19:58:20,641 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-14 19:58:20,642 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-14 19:58:20,642 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-14 19:58:20,642 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-14 19:58:20,642 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-14 19:58:20,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {120#true} is VALID [2022-04-14 19:58:20,647 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-14 19:58:20,648 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-14 19:58:20,648 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-14 19:58:20,650 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-14 19:58:20,650 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-14 19:58:20,650 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-14 19:58:20,651 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-14 19:58:20,651 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-14 19:58:20,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:58:20,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259224214] [2022-04-14 19:58:20,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259224214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:58:20,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:58:20,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:58:20,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548369783] [2022-04-14 19:58:20,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:58:20,654 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-14 19:58:20,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:58:20,654 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-14 19:58:20,668 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-14 19:58:20,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:58:20,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:58:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:58:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 19:58:20,671 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-14 19:58:22,803 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-14 19:58:31,476 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-14 19:58:35,855 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-14 19:58:38,013 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-14 19:58:40,169 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-14 19:58:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:40,364 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-14 19:58:40,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:58:40,365 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-14 19:58:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:58:40,365 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-14 19:58:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-14 19:58:40,367 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-14 19:58:40,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-14 19:58:40,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-14 19:58:40,403 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-14 19:58:40,406 INFO L225 Difference]: With dead ends: 24 [2022-04-14 19:58:40,406 INFO L226 Difference]: Without dead ends: 21 [2022-04-14 19:58:40,406 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-14 19:58:40,407 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.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, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-04-14 19:58:40,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-04-14 19:58:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-14 19:58:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-14 19:58:40,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:58:40,409 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-14 19:58:40,410 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-14 19:58:40,410 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-14 19:58:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:40,411 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-14 19:58:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-14 19:58:40,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:40,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:58:40,412 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-14 19:58:40,412 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-14 19:58:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:58:40,413 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-14 19:58:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-14 19:58:40,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:58:40,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:58:40,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:58:40,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:58:40,414 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-14 19:58:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-14 19:58:40,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-14 19:58:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:58:40,415 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-14 19:58:40,415 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-14 19:58:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-14 19:58:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 19:58:40,416 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:58:40,416 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:58:40,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 19:58:40,416 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:58:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:58:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1607843865, now seen corresponding path program 1 times [2022-04-14 19:58:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:58:40,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595207394] [2022-04-14 19:58:40,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:58:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:58:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:40,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:58:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:40,964 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-14 19:58:40,964 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-14 19:58:40,964 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-14 19:58:40,965 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-14 19:58:40,965 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-14 19:58:40,965 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-14 19:58:40,965 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-14 19:58:40,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-14 19:58:40,966 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-14 19:58:40,967 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-14 19:58:40,968 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-14 19:58:40,969 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-14 19:58:40,970 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-14 19:58:40,972 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-14 19:58:40,974 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-14 19:58:40,975 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-14 19:58:40,975 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-14 19:58:40,976 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-14 19:58:40,976 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-14 19:58:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:58:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595207394] [2022-04-14 19:58:40,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595207394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:58:40,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999904773] [2022-04-14 19:58:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:58:40,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:58:40,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:58:40,979 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-14 19:58:40,980 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-14 19:58:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:41,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-14 19:58:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:58:41,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:58:41,420 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-14 19:58:41,423 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-14 19:58:41,424 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-14 19:58:41,424 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-14 19:58:41,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-14 19:58:41,425 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-14 19:58:41,426 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-14 19:58:41,428 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-14 19:58:41,429 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-14 19:58:41,429 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-14 19:58:41,430 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-14 19:58:41,431 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-14 19:58:41,432 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-14 19:58:41,432 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-14 19:58:41,432 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-14 19:58:41,433 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-14 19:58:41,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:58:41,795 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-14 19:58:41,796 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-14 19:58:41,796 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-14 19:58:41,797 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-14 19:58:41,797 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-14 19:58:41,799 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-14 19:58:43,904 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-14 19:58:43,905 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-14 19:58:43,906 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-14 19:58:43,907 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-14 19:58:43,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {223#true} is VALID [2022-04-14 19:58:43,907 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-14 19:58:43,908 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-14 19:58:43,908 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-14 19:58:43,908 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-14 19:58:43,908 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-14 19:58:43,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999904773] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:58:43,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:58:43,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-14 19:58:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539258140] [2022-04-14 19:58:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:58:43,909 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-14 19:58:43,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:58:43,910 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-14 19:58:46,045 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-14 19:58:46,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:58:46,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:58:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:58:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-14 19:58:46,047 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-14 19:58:48,128 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-14 19:58:50,314 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-14 19:58:52,419 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-14 19:58:58,865 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-14 19:59:01,024 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-14 19:59:09,751 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-14 19:59:11,913 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-14 19:59:16,262 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-14 19:59:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:59:16,423 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-14 19:59:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:59:16,423 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-14 19:59:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:59:16,423 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-14 19:59:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-14 19:59:16,425 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-14 19:59:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-14 19:59:16,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-14 19:59:18,573 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-14 19:59:18,574 INFO L225 Difference]: With dead ends: 26 [2022-04-14 19:59:18,574 INFO L226 Difference]: Without dead ends: 23 [2022-04-14 19:59:18,575 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-14 19:59:18,575 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-04-14 19:59:18,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 8 Unknown, 0 Unchecked, 16.7s Time] [2022-04-14 19:59:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-14 19:59:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-14 19:59:18,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:59:18,578 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-14 19:59:18,578 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-14 19:59:18,578 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-14 19:59:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:59:18,581 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-14 19:59:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 19:59:18,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:59:18,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:59:18,582 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-14 19:59:18,583 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-14 19:59:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:59:18,585 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-14 19:59:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-14 19:59:18,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:59:18,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:59:18,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:59:18,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:59:18,586 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-14 19:59:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-14 19:59:18,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15 [2022-04-14 19:59:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:59:18,587 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-14 19:59:18,587 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-14 19:59:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-14 19:59:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-14 19:59:18,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:59:18,588 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:59:18,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 19:59:18,804 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-14 19:59:18,805 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:59:18,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:59:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1132300265, now seen corresponding path program 1 times [2022-04-14 19:59:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:59:18,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238458214] [2022-04-14 19:59:18,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:59:18,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:59:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:59:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:59:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:59:19,105 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-14 19:59:19,105 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-14 19:59:19,106 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-14 19:59:19,107 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-14 19:59:19,108 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-14 19:59:19,110 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-14 19:59:19,112 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-14 19:59:19,116 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-14 19:59:19,117 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-14 19:59:19,117 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-14 19:59:19,118 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-14 19:59:19,118 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-14 19:59:19,118 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-14 19:59:19,119 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-14 19:59:19,119 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-14 19:59:19,119 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-14 19:59:19,119 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-14 19:59:19,119 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-14 19:59:19,119 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-14 19:59:19,120 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-14 19:59:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:59:19,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238458214] [2022-04-14 19:59:19,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238458214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 19:59:19,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 19:59:19,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 19:59:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286218107] [2022-04-14 19:59:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:59:19,121 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-14 19:59:19,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:59:19,122 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-14 19:59:21,296 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-14 19:59:21,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 19:59:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:59:21,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 19:59:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-14 19:59:21,297 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-14 19:59:25,616 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-14 19:59:29,964 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-14 19:59:32,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 19:59:36,565 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-14 19:59:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:59:38,993 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-14 19:59:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 19:59:38,994 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-14 19:59:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 19:59:38,994 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-14 19:59:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-14 19:59:38,995 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-14 19:59:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-14 19:59:38,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-14 19:59:41,186 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-14 19:59:41,187 INFO L225 Difference]: With dead ends: 25 [2022-04-14 19:59:41,187 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 19:59:41,187 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-14 19:59:41,188 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.6s IncrementalHoareTripleChecker+Time [2022-04-14 19:59:41,188 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.6s Time] [2022-04-14 19:59:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 19:59:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-14 19:59:41,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 19:59:41,190 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-14 19:59:41,190 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-14 19:59:41,190 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-14 19:59:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:59:41,191 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-14 19:59:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-14 19:59:41,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:59:41,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:59:41,192 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-14 19:59:41,192 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-14 19:59:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 19:59:41,193 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-14 19:59:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-14 19:59:41,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 19:59:41,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 19:59:41,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 19:59:41,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 19:59:41,193 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-14 19:59:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-14 19:59:41,194 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2022-04-14 19:59:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 19:59:41,194 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-14 19:59:41,194 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-14 19:59:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-14 19:59:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 19:59:41,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 19:59:41,195 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 19:59:41,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 19:59:41,195 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 19:59:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 19:59:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash -932165961, now seen corresponding path program 1 times [2022-04-14 19:59:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 19:59:41,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780356658] [2022-04-14 19:59:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:59:41,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 19:59:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:59:41,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 19:59:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:59:41,501 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-14 19:59:41,501 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-14 19:59:41,502 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-14 19:59:41,503 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-14 19:59:41,504 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-14 19:59:41,504 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-14 19:59:41,505 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-14 19:59:41,507 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-14 19:59:41,508 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-14 19:59:41,509 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-14 19:59:41,509 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-14 19:59:41,509 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-14 19:59:41,511 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-14 19:59:41,513 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-14 19:59:41,514 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-14 19:59:41,517 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-14 19:59:41,517 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-14 19:59:41,517 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-14 19:59:41,518 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-14 19:59:41,518 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-14 19:59:41,518 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-14 19:59:41,518 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-14 19:59:41,519 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-14 19:59:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 19:59:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780356658] [2022-04-14 19:59:41,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780356658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 19:59:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294412733] [2022-04-14 19:59:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 19:59:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 19:59:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 19:59:41,521 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-14 19:59:41,522 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-14 19:59:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:59:41,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 19:59:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 19:59:41,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 19:59:42,001 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-14 19:59:42,001 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-14 19:59:42,001 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-14 19:59:42,001 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-14 19:59:42,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-14 19:59:42,020 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-14 19:59:42,021 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-14 19:59:42,022 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-14 19:59:42,022 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-14 19:59:42,023 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-14 19:59:42,023 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-14 19:59:42,023 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-14 19:59:42,024 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-14 19:59:42,024 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-14 19:59:42,025 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-14 19:59:42,026 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-14 19:59:42,026 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-14 19:59:42,027 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-14 19:59:42,027 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-14 19:59:42,027 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-14 19:59:42,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 19:59:42,256 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-14 19:59:42,257 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-14 19:59:42,257 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-14 19:59:42,258 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-14 19:59:42,258 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-14 19:59:42,260 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-14 19:59:44,374 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-14 19:59:44,375 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-14 19:59:44,376 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-14 19:59:44,380 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-14 19:59:46,494 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-14 19:59:46,495 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-14 19:59:46,495 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-14 19:59:46,496 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-14 19:59:46,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#true} is VALID [2022-04-14 19:59:46,496 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-14 19:59:46,496 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-14 19:59:46,497 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-14 19:59:46,497 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-14 19:59:46,497 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-14 19:59:46,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294412733] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 19:59:46,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 19:59:46,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 9] total 17 [2022-04-14 19:59:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721164302] [2022-04-14 19:59:46,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 19:59:46,498 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-14 19:59:46,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 19:59:46,498 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-14 19:59:48,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 19:59:48,645 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 19:59:48,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 19:59:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 19:59:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-14 19:59:48,646 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-14 19:59:50,756 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-14 19:59:52,933 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-14 19:59:59,468 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-14 20:00:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:06,147 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-14 20:00:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:00:06,147 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-14 20:00:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:00:06,147 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-14 20:00:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-14 20:00:06,148 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-14 20:00:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-04-14 20:00:06,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-04-14 20:00:10,417 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-14 20:00:10,417 INFO L225 Difference]: With dead ends: 31 [2022-04-14 20:00:10,417 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 20:00:10,418 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-14 20:00:10,418 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 47 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-14 20:00:10,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-14 20:00:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 20:00:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-14 20:00:10,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:00:10,420 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-14 20:00:10,420 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-14 20:00:10,421 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-14 20:00:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:10,422 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-14 20:00:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-14 20:00:10,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:00:10,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:00:10,422 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-14 20:00:10,422 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-14 20:00:10,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:10,423 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-14 20:00:10,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-14 20:00:10,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:00:10,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:00:10,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:00:10,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:00:10,424 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-14 20:00:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-14 20:00:10,426 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-14 20:00:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:00:10,426 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-14 20:00:10,426 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-14 20:00:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-14 20:00:10,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 20:00:10,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:00:10,428 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-14 20:00:10,447 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-14 20:00:10,643 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-14 20:00:10,643 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:00:10,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:00:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1043545585, now seen corresponding path program 1 times [2022-04-14 20:00:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:00:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864616168] [2022-04-14 20:00:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:00:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:00:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:10,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:00:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:10,750 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-14 20:00:10,750 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-14 20:00:10,750 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-14 20:00:10,751 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-14 20:00:10,751 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-14 20:00:10,751 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-14 20:00:10,751 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-14 20:00:10,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-14 20:00:10,752 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-14 20:00:10,752 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-14 20:00:10,753 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-14 20:00:10,753 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-14 20:00:10,754 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-14 20:00:10,754 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-14 20:00:10,755 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-14 20:00:10,755 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-14 20:00:10,756 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-14 20:00:10,756 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-14 20:00:10,756 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-14 20:00:10,756 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-14 20:00:10,756 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-14 20:00:10,757 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-14 20:00:10,757 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-14 20:00:10,757 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-14 20:00:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:00:10,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864616168] [2022-04-14 20:00:10,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864616168] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:00:10,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325616848] [2022-04-14 20:00:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:00:10,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:00:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:00:10,758 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-14 20:00:10,778 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-14 20:00:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:10,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 20:00:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:10,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:00:11,221 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-14 20:00:11,221 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-14 20:00:11,221 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-14 20:00:11,221 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-14 20:00:11,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-14 20:00:11,225 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-14 20:00:11,226 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-14 20:00:11,226 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-14 20:00:11,227 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-14 20:00:11,227 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-14 20:00:11,228 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-14 20:00:11,228 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-14 20:00:11,229 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-14 20:00:11,229 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-14 20:00:11,230 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-14 20:00:11,231 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-14 20:00:11,232 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-14 20:00:11,232 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-14 20:00:11,232 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-14 20:00:11,233 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-14 20:00:11,233 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-14 20:00:11,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:00:11,512 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-14 20:00:11,516 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-14 20:00:11,517 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-14 20:00:11,518 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-14 20:00:11,518 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-14 20:00:11,519 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-14 20:00:11,536 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-14 20:00:11,537 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-14 20:00:11,538 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-14 20:00:11,538 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-14 20:00:11,539 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-14 20:00:13,674 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-14 20:00:13,675 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-14 20:00:13,676 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-14 20:00:13,676 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-14 20:00:13,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {789#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {789#true} is VALID [2022-04-14 20:00:13,677 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-14 20:00:13,677 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-14 20:00:13,677 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-14 20:00:13,677 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-14 20:00:13,677 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-14 20:00:13,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325616848] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:00:13,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:00:13,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 20:00:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61067099] [2022-04-14 20:00:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:00:13,678 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-14 20:00:13,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:00:13,678 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-14 20:00:15,835 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-14 20:00:15,836 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:00:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:00:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:00:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 20:00:15,837 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-14 20:00:17,900 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-14 20:00:22,200 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-14 20:00:24,324 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-14 20:00:26,553 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-14 20:00:28,680 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-14 20:00:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:28,943 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-14 20:00:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:00:28,943 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-14 20:00:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:00:28,944 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-14 20:00:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:00:28,945 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-14 20:00:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:00:28,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-14 20:00:31,165 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-14 20:00:31,168 INFO L225 Difference]: With dead ends: 38 [2022-04-14 20:00:31,168 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 20:00:31,169 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-14 20:00:31,170 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.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, 53 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-04-14 20:00:31,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-04-14 20:00:31,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 20:00:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 20:00:31,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:00:31,183 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-14 20:00:31,184 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-14 20:00:31,184 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-14 20:00:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:31,186 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-14 20:00:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-14 20:00:31,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:00:31,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:00:31,190 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-14 20:00:31,190 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-14 20:00:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:31,194 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-14 20:00:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-14 20:00:31,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:00:31,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:00:31,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:00:31,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:00:31,196 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-14 20:00:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 20:00:31,198 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 20 [2022-04-14 20:00:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:00:31,203 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 20:00:31,203 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-14 20:00:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 20:00:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 20:00:31,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:00:31,204 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-14 20:00:31,222 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-14 20:00:31,407 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-14 20:00:31,408 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:00:31,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:00:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash -58795524, now seen corresponding path program 1 times [2022-04-14 20:00:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:00:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525427147] [2022-04-14 20:00:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:00:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:00:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:00:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:31,739 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-14 20:00:31,739 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-14 20:00:31,740 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-14 20:00:31,741 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-14 20:00:31,741 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-14 20:00:31,742 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-14 20:00:31,742 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-14 20:00:31,743 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-14 20:00:31,743 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-14 20:00:31,744 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-14 20:00:31,744 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-14 20:00:31,745 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-14 20:00:31,745 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-14 20:00:31,752 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-14 20:00:31,753 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-14 20:00:31,754 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-14 20:00:31,756 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-14 20:00:31,759 INFO 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 VALID [2022-04-14 20:00:31,761 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-14 20:00:31,762 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-14 20:00:31,762 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-14 20:00:31,762 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-14 20:00:31,762 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-14 20:00:31,763 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-14 20:00:31,763 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-14 20:00:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:00:31,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525427147] [2022-04-14 20:00:31,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525427147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:00:31,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575890840] [2022-04-14 20:00:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:00:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:00:31,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:00:31,769 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-14 20:00:31,770 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-14 20:00:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:31,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 20:00:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:31,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:00:32,316 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-14 20:00:32,316 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-14 20:00:32,316 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-14 20:00:32,316 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-14 20:00:32,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {1069#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-14 20:00:32,317 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-14 20:00:32,318 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-14 20:00:32,318 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-14 20:00:32,319 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-14 20:00:32,319 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-14 20:00:32,320 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-14 20:00:32,320 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-14 20:00:32,321 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-14 20:00:32,321 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-14 20:00:32,322 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-14 20:00:32,322 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-14 20:00:32,323 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-14 20:00:32,324 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-14 20:00:32,324 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-14 20:00:32,325 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-14 20:00:32,325 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-14 20:00:32,325 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-14 20:00:32,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:00:32,608 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-14 20:00:32,609 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-14 20:00:32,609 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-14 20:00:32,610 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-14 20:00:32,610 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-14 20:00:32,612 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-14 20:00:34,722 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-14 20:00:34,722 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-14 20:00:34,723 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-14 20:00:34,723 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-14 20:00:34,723 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-14 20:00:34,727 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-14 20:00:36,827 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-14 20:00:36,827 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-14 20:00:36,828 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-14 20:00:36,828 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-14 20:00:36,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {1069#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1069#true} is VALID [2022-04-14 20:00:36,828 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-14 20:00:36,828 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-14 20:00:36,829 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-14 20:00:36,829 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-14 20:00:36,829 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-14 20:00:36,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575890840] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:00:36,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:00:36,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-14 20:00:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693093180] [2022-04-14 20:00:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:00:36,830 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-14 20:00:36,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:00:36,831 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-14 20:00:41,090 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-14 20:00:41,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:00:41,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:00:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:00:41,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-14 20:00:41,091 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-14 20:00:43,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-14 20:00:45,346 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-14 20:00:47,462 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-14 20:00:49,696 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-14 20:00:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:49,945 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-14 20:00:49,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:00:49,945 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-14 20:00:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:00:49,945 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-14 20:00:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:00:49,946 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-14 20:00:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:00:49,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-14 20:00:54,237 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-14 20:00:54,238 INFO L225 Difference]: With dead ends: 43 [2022-04-14 20:00:54,238 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 20:00:54,238 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-14 20:00:54,239 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-14 20:00:54,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-04-14 20:00:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 20:00:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-04-14 20:00:54,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:00:54,241 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-14 20:00:54,242 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-14 20:00:54,242 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-14 20:00:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:54,243 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 20:00:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-14 20:00:54,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:00:54,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:00:54,244 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-14 20:00:54,244 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-14 20:00:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:00:54,245 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-14 20:00:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2022-04-14 20:00:54,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:00:54,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:00:54,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:00:54,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:00:54,246 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-14 20:00:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-04-14 20:00:54,247 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2022-04-14 20:00:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:00:54,247 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-04-14 20:00:54,247 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-14 20:00:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-14 20:00:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 20:00:54,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:00:54,248 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-14 20:00:54,275 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-14 20:00:54,467 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-14 20:00:54,468 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:00:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:00:54,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2116274639, now seen corresponding path program 1 times [2022-04-14 20:00:54,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:00:54,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168096912] [2022-04-14 20:00:54,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:00:54,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:00:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:54,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:00:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:54,570 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-14 20:00:54,570 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-14 20:00:54,570 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-14 20:00:54,571 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-14 20:00:54,571 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-14 20:00:54,571 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-14 20:00:54,571 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-14 20:00:54,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-14 20:00:54,572 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-14 20:00:54,572 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-14 20:00:54,573 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-14 20:00:54,573 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-14 20:00:54,574 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-14 20:00:54,574 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-14 20:00:54,575 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-14 20:00:54,575 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-14 20:00:54,575 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-14 20:00:54,576 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-14 20:00:54,577 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-14 20:00:54,577 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-14 20:00:54,577 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-14 20:00:54,577 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-14 20:00:54,577 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-14 20:00:54,577 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-14 20:00:54,578 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-14 20:00:54,578 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-14 20:00:54,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:00:54,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168096912] [2022-04-14 20:00:54,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168096912] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:00:54,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681283883] [2022-04-14 20:00:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:00:54,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:00:54,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:00:54,579 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-14 20:00:54,604 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-14 20:00:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:54,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 20:00:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:00:54,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:00:55,108 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-14 20:00:55,108 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-14 20:00:55,108 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-14 20:00:55,108 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-14 20:00:55,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-14 20:00:55,109 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-14 20:00:55,109 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-14 20:00:55,110 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-14 20:00:55,110 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-14 20:00:55,111 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-14 20:00:55,111 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-14 20:00:55,112 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-14 20:00:55,112 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-14 20:00:55,113 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-14 20:00:55,113 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-14 20:00:55,113 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-14 20:00:55,114 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-14 20:00:55,114 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-14 20:00:55,115 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-14 20:00:55,116 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-14 20:00:55,116 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-14 20:00:55,116 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-14 20:00:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 20:00:55,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:00:55,350 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-14 20:00:55,351 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-14 20:00:55,351 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-14 20:00:55,352 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-14 20:00:55,353 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-14 20:00:55,354 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-14 20:00:55,388 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-14 20:00:55,389 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-14 20:00:55,389 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-14 20:00:55,390 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-14 20:00:55,390 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-14 20:00:55,391 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-14 20:00:55,392 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-14 20:00:57,517 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-14 20:00:57,518 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-14 20:00:57,518 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-14 20:00:57,527 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-14 20:00:57,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {1377#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1377#true} is VALID [2022-04-14 20:00:57,528 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-14 20:00:57,528 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-14 20:00:57,528 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-14 20:00:57,528 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-14 20:00:57,528 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-14 20:00:57,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681283883] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:00:57,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:00:57,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 20:00:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016317585] [2022-04-14 20:00:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:00:57,529 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-14 20:00:57,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:00:57,529 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-14 20:00:59,721 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-14 20:00:59,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:00:59,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:00:59,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:00:59,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-14 20:00:59,722 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-14 20:01:01,782 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-14 20:01:03,958 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-14 20:01:06,070 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-14 20:01:08,296 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-14 20:01:10,414 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-14 20:01:12,572 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-14 20:01:14,757 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-14 20:01:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:17,048 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2022-04-14 20:01:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:01:17,049 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-14 20:01:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:01:17,049 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-14 20:01:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:01:17,050 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-14 20:01:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:01:17,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-14 20:01:19,280 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-14 20:01:19,281 INFO L225 Difference]: With dead ends: 51 [2022-04-14 20:01:19,281 INFO L226 Difference]: Without dead ends: 48 [2022-04-14 20:01:19,281 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-14 20:01:19,282 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:01:19,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 7 Unknown, 0 Unchecked, 15.0s Time] [2022-04-14 20:01:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-14 20:01:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-14 20:01:19,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:01:19,288 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-14 20:01:19,288 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-14 20:01:19,289 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-14 20:01:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:19,290 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-14 20:01:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-14 20:01:19,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:19,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:19,290 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-14 20:01:19,290 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-14 20:01:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:19,292 INFO L93 Difference]: Finished difference Result 48 states and 70 transitions. [2022-04-14 20:01:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-14 20:01:19,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:19,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:19,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:01:19,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:01:19,293 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-14 20:01:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2022-04-14 20:01:19,293 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 22 [2022-04-14 20:01:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:01:19,294 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2022-04-14 20:01:19,294 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-14 20:01:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2022-04-14 20:01:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 20:01:19,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:01:19,295 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-14 20:01:19,314 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-14 20:01:19,507 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-14 20:01:19,507 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:01:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:01:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1618193969, now seen corresponding path program 1 times [2022-04-14 20:01:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:01:19,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480936545] [2022-04-14 20:01:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:01:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:01:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:01:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:19,599 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-14 20:01:19,600 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-14 20:01:19,600 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-14 20:01:19,601 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-14 20:01:19,601 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-14 20:01:19,601 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-14 20:01:19,601 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-14 20:01:19,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {1722#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-14 20:01:19,602 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-14 20:01:19,602 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-14 20:01:19,602 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-14 20:01:19,602 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-14 20:01:19,603 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-14 20:01:19,603 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-14 20:01:19,603 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-14 20:01:19,604 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-14 20:01:19,605 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-14 20:01:19,606 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-14 20:01:19,606 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-14 20:01:19,609 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-14 20:01:19,610 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-14 20:01:19,610 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-14 20:01:19,611 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-14 20:01:19,611 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-14 20:01:19,611 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-14 20:01:19,612 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-14 20:01:19,612 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-14 20:01:19,612 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-14 20:01:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:01:19,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480936545] [2022-04-14 20:01:19,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480936545] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:01:19,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802532451] [2022-04-14 20:01:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:01:19,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:01:19,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:01:19,614 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-14 20:01:19,615 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-14 20:01:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:19,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 20:01:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:19,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:01:20,219 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-14 20:01:20,220 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-14 20:01:20,220 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-14 20:01:20,220 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-14 20:01:20,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1722#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-14 20:01:20,227 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-14 20:01:20,227 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-14 20:01:20,228 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-14 20:01:20,228 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-14 20:01:20,229 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-14 20:01:20,229 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-14 20:01:20,229 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-14 20:01:20,230 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-14 20:01:20,230 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-14 20:01:20,231 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-14 20:01:20,231 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-14 20:01:20,232 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-14 20:01:20,232 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-14 20:01:20,233 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-14 20:01:20,233 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-14 20:01:20,234 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-14 20:01:20,234 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-14 20:01:20,234 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-14 20:01:20,235 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-14 20:01:20,235 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-14 20:01:20,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:01:20,537 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-14 20:01:20,537 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-14 20:01:20,538 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-14 20:01:20,538 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-14 20:01:20,539 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-14 20:01:20,540 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-14 20:01:20,582 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-14 20:01:20,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-14 20:01:20,587 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-14 20:01:20,588 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-14 20:01:20,589 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-14 20:01:22,698 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-14 20:01:22,699 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-14 20:01:22,699 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-14 20:01:22,707 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-14 20:01:24,822 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-14 20:01:24,823 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-14 20:01:24,823 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-14 20:01:24,823 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-14 20:01:24,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {1722#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1722#true} is VALID [2022-04-14 20:01:24,824 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-14 20:01:24,824 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-14 20:01:24,824 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-14 20:01:24,824 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-14 20:01:24,824 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-14 20:01:24,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802532451] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:01:24,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:01:24,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-14 20:01:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686679683] [2022-04-14 20:01:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:01:24,825 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-14 20:01:24,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:01:24,826 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-14 20:01:29,082 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-14 20:01:29,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:01:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:01:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:01:29,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 20:01:29,083 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-14 20:01:31,118 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-14 20:01:35,359 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-14 20:01:37,582 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-14 20:01:39,820 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-14 20:01:41,941 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-14 20:01:44,056 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-14 20:01:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:46,421 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2022-04-14 20:01:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:01:46,421 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-14 20:01:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:01:46,421 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-14 20:01:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:01:46,422 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-14 20:01:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:01:46,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-14 20:01:50,686 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-14 20:01:50,688 INFO L225 Difference]: With dead ends: 57 [2022-04-14 20:01:50,688 INFO L226 Difference]: Without dead ends: 54 [2022-04-14 20:01:50,688 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-14 20:01:50,689 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:01:50,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 13.0s Time] [2022-04-14 20:01:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-14 20:01:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-04-14 20:01:50,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:01:50,692 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-14 20:01:50,692 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-14 20:01:50,692 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-14 20:01:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:50,704 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-14 20:01:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-14 20:01:50,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:50,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:50,705 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-14 20:01:50,705 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-14 20:01:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:01:50,706 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2022-04-14 20:01:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2022-04-14 20:01:50,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:01:50,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:01:50,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:01:50,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:01:50,707 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-14 20:01:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2022-04-14 20:01:50,708 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 24 [2022-04-14 20:01:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:01:50,708 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2022-04-14 20:01:50,708 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-14 20:01:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2022-04-14 20:01:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 20:01:50,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:01:50,708 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-14 20:01:50,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 20:01:50,923 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-14 20:01:50,924 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:01:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:01:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash 850752026, now seen corresponding path program 1 times [2022-04-14 20:01:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:01:50,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190355958] [2022-04-14 20:01:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:01:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:01:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:01:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:51,207 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-14 20:01:51,207 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-14 20:01:51,213 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-14 20:01:51,213 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-14 20:01:51,214 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-14 20:01:51,214 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-14 20:01:51,215 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-14 20:01:51,215 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-14 20:01:51,216 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-14 20:01:51,216 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-14 20:01:51,216 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-14 20:01:51,217 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-14 20:01:51,217 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-14 20:01:51,218 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-14 20:01:51,218 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-14 20:01:51,218 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-14 20:01:51,222 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-14 20:01:51,243 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-14 20:01:51,244 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-14 20:01:51,245 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-14 20:01:51,245 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-14 20:01:51,247 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-14 20:01:51,248 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-14 20:01:51,248 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-14 20:01:51,248 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-14 20:01:51,248 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-14 20:01:51,248 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-14 20:01:51,248 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-14 20:01:51,248 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-14 20:01:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:01:51,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190355958] [2022-04-14 20:01:51,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190355958] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:01:51,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111469084] [2022-04-14 20:01:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:01:51,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:01:51,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:01:51,264 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-14 20:01:51,265 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-14 20:01:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:51,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 20:01:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:01:51,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:01:51,951 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-14 20:01:51,951 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-14 20:01:51,952 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-14 20:01:51,952 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-14 20:01:51,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {2097#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-14 20:01:51,952 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-14 20:01:51,953 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-14 20:01:51,953 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-14 20:01:51,955 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-14 20:01:51,956 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-14 20:01:51,956 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-14 20:01:51,957 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-14 20:01:51,957 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-14 20:01:51,958 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-14 20:01:51,958 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-14 20:01:51,959 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-14 20:01:51,959 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-14 20:01:51,959 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-14 20:01:51,960 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-14 20:01:51,960 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-14 20:01:51,961 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-14 20:01:51,963 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-14 20:01:51,963 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-14 20:01:51,964 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-14 20:01:51,964 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-14 20:01:51,964 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-14 20:01:51,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:01:52,399 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-14 20:01:52,399 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-14 20:01:52,400 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-14 20:01:52,401 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-14 20:01:52,401 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-14 20:01:52,402 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-14 20:01:54,516 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-14 20:01:54,517 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-14 20:01:54,517 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-14 20:01:54,517 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-14 20:01:54,518 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-14 20:01:54,521 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-14 20:01:56,630 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-14 20:01:56,631 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-14 20:01:56,631 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-14 20:01:56,635 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-14 20:01:58,749 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-14 20:01:58,750 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-14 20:01:58,750 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-14 20:01:58,757 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-14 20:01:58,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {2097#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2097#true} is VALID [2022-04-14 20:01:58,757 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-14 20:01:58,757 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-14 20:01:58,757 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-14 20:01:58,758 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-14 20:01:58,758 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-14 20:01:58,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111469084] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:01:58,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:01:58,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 21 [2022-04-14 20:01:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823116269] [2022-04-14 20:01:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:01:58,759 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-14 20:01:58,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:01:58,759 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-14 20:02:05,130 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-14 20:02:05,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:02:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:02:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:02:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-14 20:02:05,131 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-14 20:02:07,190 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-14 20:02:09,386 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-14 20:02:11,639 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-14 20:02:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:02:16,138 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2022-04-14 20:02:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:02:16,139 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-14 20:02:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:02:16,144 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-14 20:02:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:02:16,146 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-14 20:02:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-14 20:02:16,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-14 20:02:22,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 35 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 20:02:22,552 INFO L225 Difference]: With dead ends: 54 [2022-04-14 20:02:22,552 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 20:02:22,552 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-14 20:02:22,553 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-14 20:02:22,553 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-14 20:02:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 20:02:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-04-14 20:02:22,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:02:22,555 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-14 20:02:22,555 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-14 20:02:22,555 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-14 20:02:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:02:22,556 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-14 20:02:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-14 20:02:22,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:02:22,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:02:22,556 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-14 20:02:22,557 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-14 20:02:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:02:22,557 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2022-04-14 20:02:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2022-04-14 20:02:22,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:02:22,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:02:22,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:02:22,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:02:22,558 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-14 20:02:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-14 20:02:22,558 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 25 [2022-04-14 20:02:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:02:22,559 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-14 20:02:22,559 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-14 20:02:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-14 20:02:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 20:02:22,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:02:22,559 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-14 20:02:22,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-14 20:02:22,775 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-14 20:02:22,775 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:02:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:02:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash 309895635, now seen corresponding path program 1 times [2022-04-14 20:02:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:02:22,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27338453] [2022-04-14 20:02:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:02:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:02:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:02:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:22,969 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-14 20:02:22,969 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-14 20:02:22,970 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-14 20:02:22,971 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-14 20:02:22,971 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-14 20:02:22,972 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-14 20:02:22,972 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-14 20:02:22,973 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-14 20:02:22,973 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-14 20:02:22,973 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-14 20:02:22,974 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-14 20:02:22,974 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-14 20:02:22,974 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-14 20:02:22,975 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-14 20:02:22,975 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-14 20:02:22,977 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-14 20:02:22,977 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-14 20:02:22,977 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-14 20:02:22,977 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-14 20:02:22,977 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 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-14 20:02:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:02:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27338453] [2022-04-14 20:02:22,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27338453] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:02:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751180936] [2022-04-14 20:02:22,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:02:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:02:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:02:22,980 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-14 20:02:22,981 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-14 20:02:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:23,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 20:02:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:23,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:02:23,614 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-14 20:02:23,615 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-14 20:02:23,615 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-14 20:02:23,615 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-14 20:02:23,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {2468#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-14 20:02:23,616 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-14 20:02:23,616 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-14 20:02:23,617 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-14 20:02:23,617 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-14 20:02:23,618 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-14 20:02:23,618 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-14 20:02:23,619 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-14 20:02:23,619 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-14 20:02:23,620 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-14 20:02:23,620 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-14 20:02:23,621 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-14 20:02:23,621 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-14 20:02:23,622 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-14 20:02:23,622 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-14 20:02:23,623 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-14 20:02:23,623 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-14 20:02:23,624 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-14 20:02:23,625 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-14 20:02:23,625 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-14 20:02:23,625 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-14 20:02:23,626 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-14 20:02:23,626 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-14 20:02:23,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:02:23,969 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-14 20:02:23,970 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-14 20:02:23,970 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-14 20:02:23,971 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-14 20:02:23,972 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-14 20:02:23,973 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-14 20:02:23,983 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-14 20:02:23,984 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-14 20:02:23,984 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-14 20:02:23,985 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-14 20:02:23,985 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-14 20:02:23,986 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-14 20:02:23,987 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-14 20:02:26,100 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-14 20:02:26,101 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-14 20:02:26,101 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-14 20:02:26,107 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-14 20:02:28,226 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-14 20:02:28,227 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-14 20:02:28,228 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-14 20:02:28,230 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-14 20:02:28,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {2468#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2468#true} is VALID [2022-04-14 20:02:28,231 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-14 20:02:28,231 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-14 20:02:28,231 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-14 20:02:28,231 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-14 20:02:28,231 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-14 20:02:28,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751180936] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:02:28,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:02:28,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 11] total 19 [2022-04-14 20:02:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035029193] [2022-04-14 20:02:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:02:28,232 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-14 20:02:28,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:02:28,232 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-14 20:02:32,487 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-14 20:02:32,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:02:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:02:32,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:02:32,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-04-14 20:02:32,488 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-14 20:02:34,551 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-14 20:02:36,716 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-14 20:02:38,933 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-14 20:02:41,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 20:02:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:02:41,345 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2022-04-14 20:02:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:02:41,346 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-14 20:02:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:02:41,346 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-14 20:02:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:02:41,347 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-14 20:02:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:02:41,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-14 20:02:45,684 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-14 20:02:45,685 INFO L225 Difference]: With dead ends: 56 [2022-04-14 20:02:45,685 INFO L226 Difference]: Without dead ends: 53 [2022-04-14 20:02:45,685 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-14 20:02:45,686 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-14 20:02:45,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-04-14 20:02:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-14 20:02:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-14 20:02:45,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:02:45,688 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-14 20:02:45,688 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-14 20:02:45,688 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-14 20:02:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:02:45,689 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-14 20:02:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-14 20:02:45,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:02:45,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:02:45,690 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-14 20:02:45,690 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-14 20:02:45,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:02:45,690 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-04-14 20:02:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2022-04-14 20:02:45,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:02:45,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:02:45,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:02:45,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:02:45,691 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-14 20:02:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2022-04-14 20:02:45,692 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 26 [2022-04-14 20:02:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:02:45,692 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2022-04-14 20:02:45,692 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-14 20:02:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2022-04-14 20:02:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 20:02:45,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:02:45,692 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-14 20:02:45,709 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-14 20:02:45,901 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-14 20:02:45,901 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:02:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:02:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 522176238, now seen corresponding path program 1 times [2022-04-14 20:02:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:02:45,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15069677] [2022-04-14 20:02:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:02:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:02:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:46,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:02:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:46,245 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-14 20:02:46,245 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-14 20:02:46,246 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-14 20:02:46,247 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-14 20:02:46,247 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-14 20:02:46,247 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-14 20:02:46,248 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-14 20:02:46,248 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-14 20:02:46,249 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-14 20:02:46,249 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-14 20:02:46,249 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-14 20:02:46,250 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-14 20:02:46,250 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-14 20:02:46,257 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-14 20:02:46,258 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-14 20:02:46,258 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-14 20:02:46,259 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-14 20:02:46,263 INFO 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 VALID [2022-04-14 20:02:46,264 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-14 20:02:46,264 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-14 20:02:46,265 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-14 20:02:46,265 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-14 20:02:46,266 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-14 20:02:46,266 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-14 20:02:46,266 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-14 20:02:46,267 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-14 20:02:46,268 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-14 20:02:46,268 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-14 20:02:46,268 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-14 20:02:46,269 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-14 20:02:46,269 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-14 20:02:46,269 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-14 20:02:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:02:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15069677] [2022-04-14 20:02:46,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15069677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:02:46,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964749861] [2022-04-14 20:02:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:02:46,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:02:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:02:46,270 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-14 20:02:46,271 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-14 20:02:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:46,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-14 20:02:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:02:46,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:02:46,922 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-14 20:02:46,923 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-14 20:02:46,923 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-14 20:02:46,923 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-14 20:02:46,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {2849#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-14 20:02:46,923 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-14 20:02:46,924 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-14 20:02:46,924 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-14 20:02:46,925 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-14 20:02:46,925 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-14 20:02:46,925 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-14 20:02:46,926 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-14 20:02:46,926 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-14 20:02:46,927 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-14 20:02:46,927 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-14 20:02:46,927 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-14 20:02:46,928 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-14 20:02:46,928 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-14 20:02:46,929 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-14 20:02:46,929 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-14 20:02:46,930 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-14 20:02:46,930 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-14 20:02:46,930 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-14 20:02:46,931 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-14 20:02:46,932 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-14 20:02:46,932 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-14 20:02:46,932 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-14 20:02:46,932 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-14 20:02:46,933 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-14 20:02:46,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:02:47,240 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-14 20:02:47,241 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-14 20:02:47,241 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-14 20:02:47,242 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-14 20:02:47,242 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-14 20:02:47,243 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-14 20:02:47,248 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-14 20:02:47,249 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-14 20:02:47,249 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-14 20:02:47,249 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-14 20:02:47,250 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-14 20:02:47,250 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-14 20:02:47,251 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-14 20:02:49,354 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-14 20:02:49,355 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-14 20:02:49,355 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-14 20:02:49,355 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-14 20:02:49,356 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-14 20:02:49,359 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-14 20:02:51,470 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-14 20:02:51,470 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-14 20:02:51,471 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-14 20:02:51,471 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-14 20:02:51,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {2849#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2849#true} is VALID [2022-04-14 20:02:51,471 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-14 20:02:51,471 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-14 20:02:51,472 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-14 20:02:51,472 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-14 20:02:51,472 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-14 20:02:51,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964749861] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:02:51,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:02:51,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-14 20:02:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668325891] [2022-04-14 20:02:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:02:51,473 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-14 20:02:51,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:02:51,473 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-14 20:02:55,739 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-14 20:02:55,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:02:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:02:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:02:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-14 20:02:55,740 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-14 20:02:57,785 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-14 20:02:59,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-14 20:03:02,070 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-14 20:03:04,184 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-14 20:03:06,461 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-14 20:03:08,568 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-14 20:03:10,749 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-14 20:03:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:03:10,994 INFO L93 Difference]: Finished difference Result 69 states and 105 transitions. [2022-04-14 20:03:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:03:10,994 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-14 20:03:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:03:10,994 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-14 20:03:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:03:10,995 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-14 20:03:10,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-14 20:03:10,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-14 20:03:15,351 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-14 20:03:15,352 INFO L225 Difference]: With dead ends: 69 [2022-04-14 20:03:15,352 INFO L226 Difference]: Without dead ends: 66 [2022-04-14 20:03:15,352 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-14 20:03:15,353 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.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, 57 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:03:15,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 7 Unknown, 0 Unchecked, 15.1s Time] [2022-04-14 20:03:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-14 20:03:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-14 20:03:15,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:03:15,355 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-14 20:03:15,355 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-14 20:03:15,355 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-14 20:03:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:03:15,356 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-14 20:03:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-14 20:03:15,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:03:15,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:03:15,357 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-14 20:03:15,357 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-14 20:03:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:03:15,358 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2022-04-14 20:03:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-14 20:03:15,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:03:15,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:03:15,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:03:15,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:03:15,358 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-14 20:03:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2022-04-14 20:03:15,360 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 28 [2022-04-14 20:03:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:03:15,360 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2022-04-14 20:03:15,360 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-14 20:03:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2022-04-14 20:03:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 20:03:15,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:03:15,362 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-14 20:03:15,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 20:03:15,578 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-14 20:03:15,578 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:03:15,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:03:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2133946640, now seen corresponding path program 1 times [2022-04-14 20:03:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:03:15,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784870756] [2022-04-14 20:03:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:03:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:03:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:03:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:03:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:03:15,656 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-14 20:03:15,656 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-14 20:03:15,656 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-14 20:03:15,656 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-14 20:03:15,656 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-14 20:03:15,657 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-14 20:03:15,657 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-14 20:03:15,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {3311#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-14 20:03:15,657 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-14 20:03:15,657 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-14 20:03:15,658 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-14 20:03:15,658 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-14 20:03:15,658 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-14 20:03:15,658 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-14 20:03:15,659 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-14 20:03:15,659 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-14 20:03:15,660 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-14 20:03:15,660 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-14 20:03:15,660 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-14 20:03:15,661 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-14 20:03:15,661 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-14 20:03:15,661 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-14 20:03:15,662 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-14 20:03:15,662 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-14 20:03:15,663 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-14 20:03:15,663 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-14 20:03:15,663 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-14 20:03:15,664 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-14 20:03:15,664 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-14 20:03:15,664 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-14 20:03:15,664 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-14 20:03:15,665 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-14 20:03:15,665 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-14 20:03:15,665 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-14 20:03:15,665 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-14 20:03:15,665 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-14 20:03:15,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:03:15,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784870756] [2022-04-14 20:03:15,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784870756] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 20:03:15,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576424052] [2022-04-14 20:03:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:03:15,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:03:15,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:03:15,666 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-14 20:03:15,667 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-14 20:03:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:03:15,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-14 20:03:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:03:15,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:03:16,445 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-14 20:03:16,445 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-14 20:03:16,445 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-14 20:03:16,445 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-14 20:03:16,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {3311#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-14 20:03:16,446 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-14 20:03:16,446 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-14 20:03:16,447 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-14 20:03:16,447 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-14 20:03:16,448 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-14 20:03:16,448 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-14 20:03:16,449 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-14 20:03:16,449 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-14 20:03:16,449 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-14 20:03:16,450 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-14 20:03:16,450 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-14 20:03:16,451 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-14 20:03:16,451 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-14 20:03:16,451 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-14 20:03:16,452 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-14 20:03:16,452 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-14 20:03:16,453 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-14 20:03:16,453 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-14 20:03:16,453 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-14 20:03:16,454 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-14 20:03:16,454 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-14 20:03:16,455 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-14 20:03:16,455 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-14 20:03:16,456 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-14 20:03:16,456 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-14 20:03:16,457 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-14 20:03:16,457 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-14 20:03:16,457 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-14 20:03:16,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:03:16,806 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-14 20:03:16,806 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-14 20:03:16,807 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-14 20:03:16,810 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-14 20:03:16,810 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-14 20:03:16,811 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-14 20:03:16,868 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-14 20:03:16,868 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-14 20:03:16,869 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-14 20:03:16,869 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-14 20:03:16,869 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-14 20:03:16,870 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-14 20:03:16,871 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-14 20:03:18,976 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-14 20:03:18,976 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-14 20:03:18,990 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-14 20:03:18,990 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-14 20:03:18,991 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-14 20:03:18,995 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-14 20:03:21,098 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-14 20:03:21,098 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-14 20:03:21,099 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-14 20:03:21,102 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-14 20:03:23,213 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-14 20:03:23,214 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-14 20:03:23,214 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-14 20:03:23,216 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-14 20:03:23,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {3311#true} [80] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3311#true} is VALID [2022-04-14 20:03:23,216 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-14 20:03:23,216 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-14 20:03:23,216 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-14 20:03:23,217 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-14 20:03:23,217 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-14 20:03:23,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576424052] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:03:23,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:03:23,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 13] total 20 [2022-04-14 20:03:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605123648] [2022-04-14 20:03:23,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:03:23,222 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-14 20:03:23,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:03:23,222 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-14 20:03:29,609 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-14 20:03:29,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 20:03:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:03:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 20:03:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2022-04-14 20:03:29,610 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-14 20:03:31,667 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-14 20:03:33,790 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-14 20:03:35,970 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-14 20:03:38,207 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-14 20:03:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:03:38,468 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-04-14 20:03:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 20:03:38,468 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-14 20:03:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:03:38,469 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-14 20:03:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-14 20:03:38,469 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-14 20:03:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-14 20:03:38,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-14 20:03:44,967 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-14 20:03:44,967 INFO L225 Difference]: With dead ends: 64 [2022-04-14 20:03:44,967 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:03:44,967 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-14 20:03:44,968 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-04-14 20:03:44,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 4 Unknown, 0 Unchecked, 8.7s Time] [2022-04-14 20:03:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:03:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:03:44,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:03:44,969 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-14 20:03:44,969 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-14 20:03:44,969 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-14 20:03:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:03:44,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:03:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:03:44,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:03:44,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:03:44,969 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-14 20:03:44,969 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-14 20:03:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:03:44,969 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:03:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:03:44,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:03:44,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:03:44,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:03:44,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:03:44,970 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-14 20:03:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:03:44,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-04-14 20:03:44,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:03:44,970 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:03:44,970 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-14 20:03:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:03:44,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:03:44,972 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:03:44,988 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-14 20:03:45,172 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-14 20:03:45,175 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:03:45,176 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:03:45,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:03:45 BasicIcfg [2022-04-14 20:03:45,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:03:45,178 INFO L158 Benchmark]: Toolchain (without parser) took 338923.49ms. Allocated memory was 182.5MB in the beginning and 293.6MB in the end (delta: 111.1MB). Free memory was 126.8MB in the beginning and 199.3MB in the end (delta: -72.4MB). Peak memory consumption was 39.0MB. Max. memory is 8.0GB. [2022-04-14 20:03:45,178 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 143.1MB in the beginning and 142.9MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:03:45,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.25ms. Allocated memory was 182.5MB in the beginning and 293.6MB in the end (delta: 111.1MB). Free memory was 126.6MB in the beginning and 265.5MB in the end (delta: -139.0MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2022-04-14 20:03:45,179 INFO L158 Benchmark]: Boogie Preprocessor took 43.53ms. Allocated memory is still 293.6MB. Free memory was 265.5MB in the beginning and 264.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:03:45,179 INFO L158 Benchmark]: RCFGBuilder took 6811.47ms. Allocated memory is still 293.6MB. Free memory was 264.0MB in the beginning and 251.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 20:03:45,179 INFO L158 Benchmark]: IcfgTransformer took 32.61ms. Allocated memory is still 293.6MB. Free memory was 251.4MB in the beginning and 249.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:03:45,179 INFO L158 Benchmark]: TraceAbstraction took 331841.47ms. Allocated memory is still 293.6MB. Free memory was 249.3MB in the beginning and 199.3MB in the end (delta: 50.0MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2022-04-14 20:03:45,180 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 182.5MB. Free memory was 143.1MB in the beginning and 142.9MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.25ms. Allocated memory was 182.5MB in the beginning and 293.6MB in the end (delta: 111.1MB). Free memory was 126.6MB in the beginning and 265.5MB in the end (delta: -139.0MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.53ms. Allocated memory is still 293.6MB. Free memory was 265.5MB in the beginning and 264.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6811.47ms. Allocated memory is still 293.6MB. Free memory was 264.0MB in the beginning and 251.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 32.61ms. Allocated memory is still 293.6MB. Free memory was 251.4MB in the beginning and 249.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 331841.47ms. Allocated memory is still 293.6MB. Free memory was 249.3MB in the beginning and 199.3MB in the end (delta: 50.0MB). Peak memory consumption was 51.4MB. 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: 331.8s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 235.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 60 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 128.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 121.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 187 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 364 SyntacticMatches, 36 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.4s 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 45 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 52.2s 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-14 20:03:45,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...