/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/nla-digbench-scaling/hard-u_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:51:26,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:51:26,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:51:26,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:51:26,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:51:26,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:51:26,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:51:26,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:51:26,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:51:26,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:51:26,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:51:26,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:51:26,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:51:26,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:51:26,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:51:26,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:51:26,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:51:26,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:51:26,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:51:26,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:51:26,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:51:26,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:51:26,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:51:26,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:51:26,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:51:26,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:51:26,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:51:26,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:51:26,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:51:26,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:51:26,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:51:26,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:51:26,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:51:26,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:51:26,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:51:26,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:51:26,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:51:26,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:51:26,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:51:26,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:51:26,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:51:26,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:51:26,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:51:26,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:51:26,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:51:26,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:51:26,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:51:26,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:51:26,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:51:26,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:51:26,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:51:26,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:51:26,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:51:26,428 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:51:26,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:51:26,428 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:51:26,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:51:26,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:51:26,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:51:26,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:51:26,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:51:26,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:51:26,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:51:26,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:51:26,430 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:51:26,430 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 19:51:26,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:51:26,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:51:26,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:51:26,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:51:26,648 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:51:26,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound20.c [2022-04-07 19:51:26,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11dc8103/962e415433fc43ce8693c96fe43532a0/FLAG56e98dd7e [2022-04-07 19:51:26,979 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:51:26,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound20.c [2022-04-07 19:51:26,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11dc8103/962e415433fc43ce8693c96fe43532a0/FLAG56e98dd7e [2022-04-07 19:51:27,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11dc8103/962e415433fc43ce8693c96fe43532a0 [2022-04-07 19:51:27,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:51:27,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:51:27,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:51:27,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:51:27,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:51:27,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355a168f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27, skipping insertion in model container [2022-04-07 19:51:27,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:51:27,452 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:51:27,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound20.c[537,550] [2022-04-07 19:51:27,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:51:27,596 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:51:27,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound20.c[537,550] [2022-04-07 19:51:27,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:51:27,619 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:51:27,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27 WrapperNode [2022-04-07 19:51:27,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:51:27,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:51:27,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:51:27,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:51:27,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:51:27,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:51:27,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:51:27,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:51:27,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:51:27,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:51:27,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 19:51:27,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 19:51:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:51:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:51:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:51:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:51:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:51:27,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:51:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:51:27,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:51:27,745 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:51:27,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:51:27,849 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:51:27,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:51:27,854 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 19:51:27,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:51:27 BoogieIcfgContainer [2022-04-07 19:51:27,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:51:27,856 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:51:27,856 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:51:27,857 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:51:27,859 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:51:27" (1/1) ... [2022-04-07 19:51:27,865 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:51:27,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:51:27 BasicIcfg [2022-04-07 19:51:27,909 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:51:27,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:51:27,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:51:27,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:51:27,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:51:27" (1/4) ... [2022-04-07 19:51:27,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b616145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:51:27, skipping insertion in model container [2022-04-07 19:51:27,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:51:27" (2/4) ... [2022-04-07 19:51:27,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b616145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:51:27, skipping insertion in model container [2022-04-07 19:51:27,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:51:27" (3/4) ... [2022-04-07 19:51:27,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b616145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:51:27, skipping insertion in model container [2022-04-07 19:51:27,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:51:27" (4/4) ... [2022-04-07 19:51:27,915 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound20.cJordan [2022-04-07 19:51:27,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:51:27,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:51:27,969 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:51:27,975 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 19:51:27,975 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:51:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:51:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 19:51:28,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:51:28,008 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:51:28,008 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:51:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:51:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1011787902, now seen corresponding path program 1 times [2022-04-07 19:51:28,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:51:28,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341618124] [2022-04-07 19:51:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:28,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:51:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:51:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-07 19:51:28,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 19:51:28,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 19:51:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:51:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-07 19:51:28,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 19:51:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-07 19:51:28,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 19:51:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-07 19:51:28,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:51:28,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {41#true} is VALID [2022-04-07 19:51:28,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 19:51:28,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 19:51:28,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-07 19:51:28,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {41#true} is VALID [2022-04-07 19:51:28,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-07 19:51:28,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-07 19:51:28,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,277 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {42#false} is VALID [2022-04-07 19:51:28,278 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-07 19:51:28,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-07 19:51:28,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,279 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,279 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#false} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-07 19:51:28,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {41#true} is VALID [2022-04-07 19:51:28,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} [114] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,281 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-07 19:51:28,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,282 INFO L272 TraceCheckUtils]: 24: Hoare triple {42#false} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {42#false} is VALID [2022-04-07 19:51:28,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {42#false} is VALID [2022-04-07 19:51:28,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-07 19:51:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:51:28,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:51:28,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341618124] [2022-04-07 19:51:28,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341618124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:51:28,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:51:28,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:51:28,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822921091] [2022-04-07 19:51:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:51:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 19:51:28,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:51:28,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:51:28,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:28,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:51:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:51:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:51:28,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:51:28,349 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:51:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:28,506 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 19:51:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:51:28,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-07 19:51:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:51:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:51:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-07 19:51:28,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:51:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-07 19:51:28,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-07 19:51:28,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:28,587 INFO L225 Difference]: With dead ends: 38 [2022-04-07 19:51:28,587 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 19:51:28,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:51:28,591 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:51:28,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:51:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 19:51:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 19:51:28,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:51:28,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:28,613 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:28,614 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:28,618 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-07 19:51:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-07 19:51:28,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:28,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:28,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-07 19:51:28,620 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-07 19:51:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:28,623 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-07 19:51:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-07 19:51:28,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:28,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:28,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:51:28,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:51:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-07 19:51:28,628 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-07 19:51:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:51:28,628 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-07 19:51:28,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:51:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-07 19:51:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 19:51:28,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:51:28,629 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:51:28,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:51:28,630 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:51:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:51:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1710049411, now seen corresponding path program 1 times [2022-04-07 19:51:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:51:28,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065557171] [2022-04-07 19:51:28,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:51:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:51:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {198#true} is VALID [2022-04-07 19:51:28,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:51:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-07 19:51:28,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 19:51:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-07 19:51:28,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 19:51:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:28,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-07 19:51:28,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {198#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:51:28,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {198#true} is VALID [2022-04-07 19:51:28,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {198#true} is VALID [2022-04-07 19:51:28,715 INFO L272 TraceCheckUtils]: 6: Hoare triple {198#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-07 19:51:28,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {198#true} {198#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {198#true} is VALID [2022-04-07 19:51:28,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {198#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-07 19:51:28,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,717 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {198#true} {198#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,717 INFO L272 TraceCheckUtils]: 17: Hoare triple {198#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {198#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {198#true} is VALID [2022-04-07 19:51:28,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {198#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {198#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 19:51:28,718 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {198#true} {198#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {198#true} is VALID [2022-04-07 19:51:28,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {198#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {215#(= main_~q~0 0)} is VALID [2022-04-07 19:51:28,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {215#(= main_~q~0 0)} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(= main_~q~0 0)} is VALID [2022-04-07 19:51:28,719 INFO L272 TraceCheckUtils]: 24: Hoare triple {215#(= main_~q~0 0)} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:28,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {217#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:51:28,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {217#(not (= __VERIFIER_assert_~cond 0))} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {199#false} is VALID [2022-04-07 19:51:28,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {199#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#false} is VALID [2022-04-07 19:51:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:51:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:51:28,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065557171] [2022-04-07 19:51:28,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065557171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:51:28,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:51:28,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:51:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479081814] [2022-04-07 19:51:28,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:51:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 19:51:28,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:51:28,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:51:28,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:28,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:51:28,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:51:28,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:51:28,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:51:28,739 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:51:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:29,171 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 19:51:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 19:51:29,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-07 19:51:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:51:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:51:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-07 19:51:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:51:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-07 19:51:29,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-07 19:51:29,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:29,235 INFO L225 Difference]: With dead ends: 44 [2022-04-07 19:51:29,235 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 19:51:29,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:51:29,240 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:51:29,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:51:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 19:51:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-07 19:51:29,244 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:51:29,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,244 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,245 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:29,247 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 19:51:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-07 19:51:29,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:29,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:29,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-07 19:51:29,249 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-07 19:51:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:29,251 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-07 19:51:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-07 19:51:29,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:29,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:29,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:51:29,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:51:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-07 19:51:29,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-07 19:51:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:51:29,254 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-07 19:51:29,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:51:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-07 19:51:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 19:51:29,260 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:51:29,260 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:51:29,260 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 19:51:29,260 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:51:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:51:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1042498848, now seen corresponding path program 1 times [2022-04-07 19:51:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:51:29,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418485692] [2022-04-07 19:51:29,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:29,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:51:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:51:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {398#true} is VALID [2022-04-07 19:51:29,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {398#true} {398#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:51:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-07 19:51:29,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 19:51:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-07 19:51:29,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 19:51:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-07 19:51:29,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-07 19:51:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {398#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {398#true} is VALID [2022-04-07 19:51:29,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {415#(= main_~A~0 main_~r~0)} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:51:29,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {398#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:51:29,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {398#true} is VALID [2022-04-07 19:51:29,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {398#true} {398#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {398#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {398#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {398#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {398#true} {398#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {398#true} is VALID [2022-04-07 19:51:29,405 INFO L272 TraceCheckUtils]: 12: Hoare triple {398#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {398#true} {398#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L272 TraceCheckUtils]: 17: Hoare triple {398#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {398#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {398#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {398#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,407 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {398#true} {398#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {398#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:51:29,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {415#(= main_~A~0 main_~r~0)} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:51:29,408 INFO L272 TraceCheckUtils]: 24: Hoare triple {415#(= main_~A~0 main_~r~0)} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {398#true} is VALID [2022-04-07 19:51:29,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {398#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {398#true} is VALID [2022-04-07 19:51:29,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {398#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {398#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {398#true} is VALID [2022-04-07 19:51:29,408 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {398#true} {415#(= main_~A~0 main_~r~0)} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {415#(= main_~A~0 main_~r~0)} is VALID [2022-04-07 19:51:29,409 INFO L272 TraceCheckUtils]: 29: Hoare triple {415#(= main_~A~0 main_~r~0)} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {420#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:29,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {421#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:51:29,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {421#(not (= __VERIFIER_assert_~cond 0))} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-07 19:51:29,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {399#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#false} is VALID [2022-04-07 19:51:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:51:29,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:51:29,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418485692] [2022-04-07 19:51:29,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418485692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:51:29,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:51:29,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:51:29,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764188434] [2022-04-07 19:51:29,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:51:29,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 19:51:29,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:51:29,412 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), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:51:29,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:29,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:51:29,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:51:29,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:51:29,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:51:29,429 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:51:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:29,804 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-07 19:51:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 19:51:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 19:51:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:51:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:51:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-07 19:51:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:51:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-07 19:51:29,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-07 19:51:29,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:29,863 INFO L225 Difference]: With dead ends: 48 [2022-04-07 19:51:29,863 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 19:51:29,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:51:29,864 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:51:29,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 48 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:51:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 19:51:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-07 19:51:29,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:51:29,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,868 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,869 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:29,871 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-07 19:51:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-07 19:51:29,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:29,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:29,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-07 19:51:29,873 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-07 19:51:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:29,875 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-07 19:51:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-07 19:51:29,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:29,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:29,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:51:29,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:51:29,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:51:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-07 19:51:29,877 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-07 19:51:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:51:29,878 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-07 19:51:29,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:51:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-07 19:51:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 19:51:29,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:51:29,879 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:51:29,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 19:51:29,879 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:51:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:51:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1436069466, now seen corresponding path program 1 times [2022-04-07 19:51:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:51:29,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100479219] [2022-04-07 19:51:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:51:29,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:51:29,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629355764] [2022-04-07 19:51:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:51:29,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:51:29,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:51:29,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 19:51:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:51:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:29,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:51:30,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {618#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {618#true} is VALID [2022-04-07 19:51:30,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {618#true} {618#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {618#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {618#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {618#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {618#true} {618#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {618#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L272 TraceCheckUtils]: 12: Hoare triple {618#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {618#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {618#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {618#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {618#true} {618#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L272 TraceCheckUtils]: 17: Hoare triple {618#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {618#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {618#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {618#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {618#true} {618#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {618#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:30,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:30,239 INFO L272 TraceCheckUtils]: 24: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {618#true} is VALID [2022-04-07 19:51:30,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {618#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {618#true} is VALID [2022-04-07 19:51:30,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {618#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {618#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,243 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {618#true} {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:30,243 INFO L272 TraceCheckUtils]: 29: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {618#true} is VALID [2022-04-07 19:51:30,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {618#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {618#true} is VALID [2022-04-07 19:51:30,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {618#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {618#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {618#true} is VALID [2022-04-07 19:51:30,244 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {618#true} {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:30,244 INFO L272 TraceCheckUtils]: 34: Hoare triple {689#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:51:30,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:30,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {619#false} is VALID [2022-04-07 19:51:30,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {619#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {619#false} is VALID [2022-04-07 19:51:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:51:30,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:51:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:51:30,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100479219] [2022-04-07 19:51:30,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:51:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629355764] [2022-04-07 19:51:30,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629355764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:51:30,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:51:30,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:51:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309252294] [2022-04-07 19:51:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:51:30,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-07 19:51:30,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:51:30,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:51:30,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:30,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:51:30,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:51:30,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:51:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:51:30,279 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:51:32,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 19:51:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:32,662 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-07 19:51:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:51:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-07 19:51:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:51:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:51:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 19:51:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:51:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 19:51:32,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-07 19:51:32,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:32,733 INFO L225 Difference]: With dead ends: 56 [2022-04-07 19:51:32,733 INFO L226 Difference]: Without dead ends: 55 [2022-04-07 19:51:32,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:51:32,734 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:51:32,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 19:51:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-07 19:51:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-07 19:51:32,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:51:32,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:51:32,739 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:51:32,739 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:51:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:32,741 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-07 19:51:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-07 19:51:32,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:32,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:32,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-07 19:51:32,742 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-07 19:51:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:32,745 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-07 19:51:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-07 19:51:32,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:32,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:32,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:51:32,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:51:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-07 19:51:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-07 19:51:32,747 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-07 19:51:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:51:32,748 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-07 19:51:32,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:51:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-07 19:51:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 19:51:32,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:51:32,749 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:51:32,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 19:51:32,969 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:51:32,970 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:51:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:51:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash 5711864, now seen corresponding path program 1 times [2022-04-07 19:51:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:51:32,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315348815] [2022-04-07 19:51:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:51:32,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:51:32,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293286177] [2022-04-07 19:51:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:32,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:51:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:51:33,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:51:33,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 19:51:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:33,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 19:51:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:33,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:51:34,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {959#true} is VALID [2022-04-07 19:51:34,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {959#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {959#true} {959#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {959#true} is VALID [2022-04-07 19:51:34,538 INFO L272 TraceCheckUtils]: 12: Hoare triple {959#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:34,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1003#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:51:34,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {1003#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1007#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:51:34,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {1007#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1007#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:51:34,541 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1007#(not (= |assume_abort_if_not_#in~cond| 0))} {959#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1014#(<= (mod main_~B~0 4294967296) 20)} is VALID [2022-04-07 19:51:34,541 INFO L272 TraceCheckUtils]: 17: Hoare triple {1014#(<= (mod main_~B~0 4294967296) 20)} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:34,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-07 19:51:34,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,542 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {959#true} {1014#(<= (mod main_~B~0 4294967296) 20)} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1014#(<= (mod main_~B~0 4294967296) 20)} is VALID [2022-04-07 19:51:34,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {1014#(<= (mod main_~B~0 4294967296) 20)} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-07 19:51:34,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-07 19:51:34,543 INFO L272 TraceCheckUtils]: 24: Hoare triple {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {959#true} is VALID [2022-04-07 19:51:34,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-07 19:51:34,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,544 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {959#true} {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-07 19:51:34,544 INFO L272 TraceCheckUtils]: 29: Hoare triple {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {959#true} is VALID [2022-04-07 19:51:34,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-07 19:51:34,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,545 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {959#true} {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-07 19:51:34,545 INFO L272 TraceCheckUtils]: 34: Hoare triple {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {959#true} is VALID [2022-04-07 19:51:34,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-07 19:51:34,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:34,546 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {959#true} {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-07 19:51:34,546 INFO L290 TraceCheckUtils]: 39: Hoare triple {1033#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1085#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:51:34,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {1085#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1085#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:51:34,549 INFO L272 TraceCheckUtils]: 41: Hoare triple {1085#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:51:34,549 INFO L290 TraceCheckUtils]: 42: Hoare triple {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:34,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {1096#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-07 19:51:34,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {960#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-07 19:51:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-07 19:51:34,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:51:35,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {960#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-07 19:51:35,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {1096#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {960#false} is VALID [2022-04-07 19:51:35,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1096#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:35,103 INFO L272 TraceCheckUtils]: 41: Hoare triple {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1092#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:51:35,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-07 19:51:35,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1112#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-07 19:51:35,107 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {959#true} {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:51:35,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-07 19:51:35,107 INFO L272 TraceCheckUtils]: 34: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {959#true} is VALID [2022-04-07 19:51:35,109 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {959#true} {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:51:35,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-07 19:51:35,109 INFO L272 TraceCheckUtils]: 29: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {959#true} is VALID [2022-04-07 19:51:35,112 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {959#true} {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:51:35,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {959#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {959#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {959#true} is VALID [2022-04-07 19:51:35,112 INFO L272 TraceCheckUtils]: 24: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:51:35,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {959#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1119#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:51:35,114 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {959#true} {959#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L290 TraceCheckUtils]: 19: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L272 TraceCheckUtils]: 17: Hoare triple {959#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {959#true} {959#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L272 TraceCheckUtils]: 12: Hoare triple {959#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {959#true} {959#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {959#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {959#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {959#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {959#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {959#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {959#true} is VALID [2022-04-07 19:51:35,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {959#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {959#true} is VALID [2022-04-07 19:51:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:51:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:51:35,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315348815] [2022-04-07 19:51:35,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:51:35,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293286177] [2022-04-07 19:51:35,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293286177] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:51:35,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:51:35,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-07 19:51:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256013072] [2022-04-07 19:51:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:51:35,117 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-07 19:51:35,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:51:35,117 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:51:35,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:35,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:51:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:51:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:51:35,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:51:35,156 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:51:39,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:51:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:39,883 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-07 19:51:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:51:39,883 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-07 19:51:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:51:39,884 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:51:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-07 19:51:39,885 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:51:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-07 19:51:39,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-07 19:51:39,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:39,946 INFO L225 Difference]: With dead ends: 66 [2022-04-07 19:51:39,946 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 19:51:39,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:51:39,947 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:51:39,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 151 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 19:51:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 19:51:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-07 19:51:39,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:51:39,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:51:39,952 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:51:39,952 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:51:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:39,954 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-07 19:51:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-07 19:51:39,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:39,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:39,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-07 19:51:39,959 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-07 19:51:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:51:39,964 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-07 19:51:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-07 19:51:39,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:51:39,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:51:39,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:51:39,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:51:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-07 19:51:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-07 19:51:39,967 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-07 19:51:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:51:39,967 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-07 19:51:39,967 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), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:51:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-07 19:51:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 19:51:39,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:51:39,970 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:51:39,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 19:51:40,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:51:40,187 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:51:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:51:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1597443315, now seen corresponding path program 1 times [2022-04-07 19:51:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:51:40,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897946890] [2022-04-07 19:51:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:51:40,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:51:40,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512952010] [2022-04-07 19:51:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:51:40,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:51:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:51:40,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:51:40,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 19:51:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:40,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-07 19:51:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:51:40,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:51:42,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {1503#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1503#true} {1503#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:42,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {1503#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {1503#true} is VALID [2022-04-07 19:51:42,272 INFO L272 TraceCheckUtils]: 12: Hoare triple {1503#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:42,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:51:42,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:51:42,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:51:42,274 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} {1503#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1558#(<= (mod main_~B~0 4294967296) 20)} is VALID [2022-04-07 19:51:42,274 INFO L272 TraceCheckUtils]: 17: Hoare triple {1558#(<= (mod main_~B~0 4294967296) 20)} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:42,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:51:42,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {1547#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:51:42,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:51:42,276 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1551#(not (= |assume_abort_if_not_#in~cond| 0))} {1558#(<= (mod main_~B~0 4294967296) 20)} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1574#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-07 19:51:42,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {1574#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)))} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:42,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:42,277 INFO L272 TraceCheckUtils]: 24: Hoare triple {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-07 19:51:42,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:42,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,286 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1503#true} {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:42,286 INFO L272 TraceCheckUtils]: 29: Hoare triple {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:42,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:42,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {1603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:42,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:42,288 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} {1578#(and (<= (mod main_~B~0 4294967296) 20) (= main_~A~0 main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1614#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:42,288 INFO L272 TraceCheckUtils]: 34: Hoare triple {1614#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1503#true} is VALID [2022-04-07 19:51:42,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:42,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {1603#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:42,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:42,291 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} {1614#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1614#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-07 19:51:42,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {1614#(and (<= (mod main_~B~0 4294967296) 20) (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] L39-->L36-2: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-07 19:51:42,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-07 19:51:42,293 INFO L272 TraceCheckUtils]: 41: Hoare triple {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-07 19:51:42,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:42,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,294 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1503#true} {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-07 19:51:42,294 INFO L272 TraceCheckUtils]: 46: Hoare triple {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:42,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:42,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:42,294 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1503#true} {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-07 19:51:42,303 INFO L272 TraceCheckUtils]: 51: Hoare triple {1633#(and (<= (mod main_~B~0 4294967296) 20) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1670#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:51:42,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {1670#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1674#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:42,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {1674#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-07 19:51:42,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {1504#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-07 19:51:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 19:51:42,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:51:44,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {1504#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-07 19:51:44,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {1674#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-07 19:51:44,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {1670#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1674#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:51:44,153 INFO L272 TraceCheckUtils]: 51: Hoare triple {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1670#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:51:44,154 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1503#true} {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-07 19:51:44,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:44,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:44,154 INFO L290 TraceCheckUtils]: 47: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:44,154 INFO L272 TraceCheckUtils]: 46: Hoare triple {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:44,160 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1503#true} {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-07 19:51:44,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:44,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:44,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:44,161 INFO L272 TraceCheckUtils]: 41: Hoare triple {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-07 19:51:44,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-07 19:51:46,168 WARN L290 TraceCheckUtils]: 39: Hoare triple {1727#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [139] L39-->L36-2: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1690#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-07 19:51:46,344 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} {1503#true} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1727#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-07 19:51:46,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:46,345 INFO L290 TraceCheckUtils]: 36: Hoare triple {1740#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1607#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:51:46,345 INFO L290 TraceCheckUtils]: 35: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1740#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:51:46,345 INFO L272 TraceCheckUtils]: 34: Hoare triple {1503#true} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1503#true} is VALID [2022-04-07 19:51:46,345 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1503#true} {1503#true} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:46,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L272 TraceCheckUtils]: 29: Hoare triple {1503#true} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1503#true} {1503#true} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {1503#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {1503#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1503#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L272 TraceCheckUtils]: 24: Hoare triple {1503#true} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {1503#true} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {1503#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1503#true} {1503#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L272 TraceCheckUtils]: 17: Hoare triple {1503#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1503#true} {1503#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L272 TraceCheckUtils]: 12: Hoare triple {1503#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {1503#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1503#true} {1503#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {1503#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {1503#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1503#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1503#true} is VALID [2022-04-07 19:51:46,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {1503#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1503#true} is VALID [2022-04-07 19:51:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-07 19:51:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:51:46,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897946890] [2022-04-07 19:51:46,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:51:46,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512952010] [2022-04-07 19:51:46,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512952010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:51:46,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:51:46,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-07 19:51:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93640734] [2022-04-07 19:51:46,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:51:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) Word has length 55 [2022-04-07 19:51:46,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:51:46,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-07 19:51:48,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 62 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:51:48,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-07 19:51:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:51:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-07 19:51:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-07 19:51:48,771 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-07 19:52:01,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 19:52:09,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 19:52:12,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:22,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:24,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:25,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:28,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:52:31,296 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-07 19:52:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 19:52:31,296 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) Word has length 55 [2022-04-07 19:52:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:52:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-07 19:52:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2022-04-07 19:52:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-07 19:52:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2022-04-07 19:52:31,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 90 transitions. [2022-04-07 19:52:35,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 89 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:52:35,512 INFO L225 Difference]: With dead ends: 87 [2022-04-07 19:52:35,512 INFO L226 Difference]: Without dead ends: 87 [2022-04-07 19:52:35,513 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-04-07 19:52:35,513 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 60 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2022-04-07 19:52:35,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 206 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 410 Invalid, 6 Unknown, 0 Unchecked, 34.6s Time] [2022-04-07 19:52:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-07 19:52:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-04-07 19:52:35,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:52:35,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:35,519 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:35,520 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:52:35,522 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-07 19:52:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-07 19:52:35,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:52:35,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:52:35,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 87 states. [2022-04-07 19:52:35,524 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 87 states. [2022-04-07 19:52:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:52:35,526 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-04-07 19:52:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-04-07 19:52:35,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:52:35,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:52:35,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:52:35,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:52:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-07 19:52:35,529 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 55 [2022-04-07 19:52:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:52:35,530 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-07 19:52:35,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 8 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-07 19:52:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-07 19:52:35,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-07 19:52:35,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:52:35,531 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:52:35,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-07 19:52:35,731 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:52:35,731 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:52:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:52:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash 810354846, now seen corresponding path program 1 times [2022-04-07 19:52:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:52:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434175068] [2022-04-07 19:52:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:52:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:52:35,740 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:52:35,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133248944] [2022-04-07 19:52:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:52:35,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:52:35,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:52:35,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:52:35,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 19:52:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:52:35,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 19:52:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:52:35,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:52:38,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2203#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {2203#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:38,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2203#true} is VALID [2022-04-07 19:52:38,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:38,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {2203#true} is VALID [2022-04-07 19:52:38,125 INFO L272 TraceCheckUtils]: 12: Hoare triple {2203#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:38,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {2203#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2247#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:52:38,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {2247#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2251#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:52:38,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {2251#(not (= |assume_abort_if_not_#in~cond| 0))} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2251#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:52:38,130 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2251#(not (= |assume_abort_if_not_#in~cond| 0))} {2203#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2258#(<= (mod main_~B~0 4294967296) 20)} is VALID [2022-04-07 19:52:38,130 INFO L272 TraceCheckUtils]: 17: Hoare triple {2258#(<= (mod main_~B~0 4294967296) 20)} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:38,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2203#true} is VALID [2022-04-07 19:52:38,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {2203#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {2203#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,140 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2203#true} {2258#(<= (mod main_~B~0 4294967296) 20)} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2258#(<= (mod main_~B~0 4294967296) 20)} is VALID [2022-04-07 19:52:38,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {2258#(<= (mod main_~B~0 4294967296) 20)} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,141 INFO L272 TraceCheckUtils]: 24: Hoare triple {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2203#true} is VALID [2022-04-07 19:52:38,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:38,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,141 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2203#true} {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,141 INFO L272 TraceCheckUtils]: 29: Hoare triple {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2203#true} {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,142 INFO L272 TraceCheckUtils]: 34: Hoare triple {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,143 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2203#true} {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {2277#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,144 INFO L272 TraceCheckUtils]: 41: Hoare triple {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2203#true} is VALID [2022-04-07 19:52:38,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:38,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,145 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2203#true} {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [153] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,145 INFO L272 TraceCheckUtils]: 46: Hoare triple {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [131] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2203#true} is VALID [2022-04-07 19:52:38,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:38,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:38,146 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2203#true} {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [154] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [136] L48-->L46-1: Formula: (= (mod v_main_~p~0_7 4294967296) 1) InVars {main_~p~0=v_main_~p~0_7} OutVars{main_~p~0=v_main_~p~0_7} AuxVars[] AssignedVars[] {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-07 19:52:38,147 INFO L272 TraceCheckUtils]: 52: Hoare triple {2329#(and (<= (mod main_~d~0 4294967296) 20) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [126] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_12 4294967296) (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:52:38,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:52:38,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {2373#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2204#false} is VALID [2022-04-07 19:52:38,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {2204#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2204#false} is VALID [2022-04-07 19:52:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-07 19:52:38,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:52:39,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {2204#false} [140] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2204#false} is VALID [2022-04-07 19:52:39,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {2373#(<= 1 __VERIFIER_assert_~cond)} [133] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2204#false} is VALID [2022-04-07 19:52:39,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2373#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:52:39,605 INFO L272 TraceCheckUtils]: 52: Hoare triple {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [126] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_12 4294967296) (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_12, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {2369#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:52:39,606 INFO L290 TraceCheckUtils]: 51: Hoare triple {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [136] L48-->L46-1: Formula: (= (mod v_main_~p~0_7 4294967296) 1) InVars {main_~p~0=v_main_~p~0_7} OutVars{main_~p~0=v_main_~p~0_7} AuxVars[] AssignedVars[] {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-07 19:52:39,606 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2203#true} {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [154] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-07 19:52:39,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:39,607 INFO L272 TraceCheckUtils]: 46: Hoare triple {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [131] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_14) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_14, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2203#true} is VALID [2022-04-07 19:52:39,607 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2203#true} {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [153] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-07 19:52:39,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:39,607 INFO L272 TraceCheckUtils]: 41: Hoare triple {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [127] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (+ v_main_~r~0_12 (* v_main_~q~0_9 v_main_~B~0_13)) 4294967296) (mod v_main_~A~0_11 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_13, main_~A~0=v_main_~A~0_11, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {2203#true} is VALID [2022-04-07 19:52:39,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} [124] L54-2-->L47: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-07 19:52:39,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [138] L39-->L54-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {2389#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-07 19:52:39,609 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2203#true} {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [152] __VERIFIER_assertEXIT-->L39: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:52:39,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:39,609 INFO L272 TraceCheckUtils]: 34: Hoare triple {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [132] L38-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (* v_main_~p~0_11 v_main_~B~0_12) 4294967296) (mod v_main_~d~0_14 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_12, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2203#true} is VALID [2022-04-07 19:52:39,609 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2203#true} {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [151] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:52:39,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L272 TraceCheckUtils]: 29: Hoare triple {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [128] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~r~0_11 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2203#true} {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [150] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:52:39,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {2203#true} [142] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {2203#true} [134] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {2203#true} [129] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2203#true} is VALID [2022-04-07 19:52:39,610 INFO L272 TraceCheckUtils]: 24: Hoare triple {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [125] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} [121] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:52:39,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {2203#true} [118] L29-->L36-2: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_5 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2429#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:52:39,611 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2203#true} {2203#true} [149] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {2203#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {2203#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {2203#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L272 TraceCheckUtils]: 17: Hoare triple {2203#true} [116] L28-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2203#true} {2203#true} [148] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {2203#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {2203#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {2203#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L272 TraceCheckUtils]: 12: Hoare triple {2203#true} [113] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_10 4294967296) 20) 1 0)) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {2203#true} [111] L26-1-->L28: Formula: (= v_main_~B~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~B~0] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2203#true} {2203#true} [147] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#true} [117] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#true} [115] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#true} [112] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {2203#true} [110] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_9 4294967296) 20) 1 0)) InVars {main_~A~0=v_main_~A~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {2203#true} [108] mainENTRY-->L26: Formula: (= v_main_~A~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {2203#true} [105] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2203#true} {2203#true} [146] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {2203#true} [109] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {2203#true} [106] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (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{#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[#NULL.offset, #NULL.base] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {2203#true} [104] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2203#true} is VALID [2022-04-07 19:52:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-07 19:52:39,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:52:39,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434175068] [2022-04-07 19:52:39,613 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:52:39,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133248944] [2022-04-07 19:52:39,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133248944] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:52:39,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:52:39,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-07 19:52:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362064618] [2022-04-07 19:52:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:52:39,614 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-07 19:52:39,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:52:39,614 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:52:39,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:52:39,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:52:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:52:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:52:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:52:39,653 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:52:46,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:48,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:51,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:52:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:52:51,512 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-07 19:52:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:52:51,513 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-07 19:52:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:52:51,513 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:52:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:52:51,514 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:52:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 19:52:51,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 19:52:51,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:52:51,596 INFO L225 Difference]: With dead ends: 88 [2022-04-07 19:52:51,597 INFO L226 Difference]: Without dead ends: 83 [2022-04-07 19:52:51,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:52:51,597 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-07 19:52:51,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-07 19:52:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-07 19:52:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-04-07 19:52:51,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:52:51,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:51,602 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:51,602 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:52:51,605 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-07 19:52:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-07 19:52:51,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:52:51,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:52:51,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-07 19:52:51,606 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-07 19:52:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:52:51,610 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-07 19:52:51,610 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-07 19:52:51,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:52:51,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:52:51,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:52:51,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:52:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-07 19:52:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-04-07 19:52:51,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 56 [2022-04-07 19:52:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:52:51,613 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-04-07 19:52:51,613 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), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-07 19:52:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-04-07 19:52:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 19:52:51,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:52:51,615 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:52:51,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 19:52:51,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:52:51,831 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:52:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:52:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1535015126, now seen corresponding path program 1 times [2022-04-07 19:52:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:52:51,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990828840] [2022-04-07 19:52:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:52:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:52:51,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:52:51,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189014398] [2022-04-07 19:52:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:52:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:52:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:52:51,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:52:51,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process