/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/divbin_valuebound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:02:31,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:02:31,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:02:31,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:02:31,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:02:31,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:02:31,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:02:31,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:02:31,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:02:31,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:02:31,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:02:31,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:02:31,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:02:31,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:02:31,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:02:31,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:02:31,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:02:31,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:02:31,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:02:31,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:02:31,602 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:02:31,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:02:31,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:02:31,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:02:31,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:02:31,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:02:31,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:02:31,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:02:31,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:02:31,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:02:31,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:02:31,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:02:31,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:02:31,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:02:31,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:02:31,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:02:31,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:02:31,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:02:31,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:02:31,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:02:31,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:02:31,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:02:31,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:02:31,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:02:31,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:02:31,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:02:31,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:02:31,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:02:31,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:02:31,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:02:31,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:02:31,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:02:31,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:02:31,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:02:31,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:02:31,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:02:31,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:02:31,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:02:31,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:02:31,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:02:31,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:02:31,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:02:31,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:02:31,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:02:31,640 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:02:31,641 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:02:31,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:02:31,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:02:31,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:02:31,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:02:31,882 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:02:31,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound5.i [2022-04-07 19:02:31,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9359817/2f050c652be6438bb1f49d6e4ad51509/FLAGbdc9c83b3 [2022-04-07 19:02:32,321 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:02:32,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound5.i [2022-04-07 19:02:32,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9359817/2f050c652be6438bb1f49d6e4ad51509/FLAGbdc9c83b3 [2022-04-07 19:02:32,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc9359817/2f050c652be6438bb1f49d6e4ad51509 [2022-04-07 19:02:32,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:02:32,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:02:32,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:02:32,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:02:32,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:02:32,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32056910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32, skipping insertion in model container [2022-04-07 19:02:32,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:02:32,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:02:32,517 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/divbin_valuebound5.i[950,963] [2022-04-07 19:02:32,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:02:32,549 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:02:32,560 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/divbin_valuebound5.i[950,963] [2022-04-07 19:02:32,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:02:32,579 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:02:32,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32 WrapperNode [2022-04-07 19:02:32,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:02:32,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:02:32,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:02:32,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:02:32,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:02:32,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:02:32,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:02:32,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:02:32,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:02:32,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:32,644 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:02:32,646 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:02:32,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:02:32,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:02:32,675 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:02:32,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:02:32,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:02:32,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:02:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:02:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:02:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 19:02:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 19:02:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:02:32,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:02:32,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:02:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:02:32,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:02:32,730 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:02:32,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:02:32,911 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:02:32,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:02:32,918 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 19:02:32,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:02:32 BoogieIcfgContainer [2022-04-07 19:02:32,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:02:32,921 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:02:32,921 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:02:32,927 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:02:32,930 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:02:32" (1/1) ... [2022-04-07 19:02:32,932 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:02:32,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:02:32 BasicIcfg [2022-04-07 19:02:32,986 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:02:32,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:02:32,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:02:32,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:02:32,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:02:32" (1/4) ... [2022-04-07 19:02:32,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8a45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:02:32, skipping insertion in model container [2022-04-07 19:02:32,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:02:32" (2/4) ... [2022-04-07 19:02:32,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8a45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:02:32, skipping insertion in model container [2022-04-07 19:02:32,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:02:32" (3/4) ... [2022-04-07 19:02:32,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8a45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:02:32, skipping insertion in model container [2022-04-07 19:02:32,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:02:32" (4/4) ... [2022-04-07 19:02:32,994 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound5.iJordan [2022-04-07 19:02:32,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:02:32,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:02:33,038 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:02:33,043 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:02:33,044 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:02:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:02:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 19:02:33,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:33,068 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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:02:33,069 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -402483300, now seen corresponding path program 1 times [2022-04-07 19:02:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:33,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930637839] [2022-04-07 19:02:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:02:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {37#true} is VALID [2022-04-07 19:02:33,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 19:02:33,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 19:02:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:02:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {38#false} is VALID [2022-04-07 19:02:33,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 19:02:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {38#false} is VALID [2022-04-07 19:02:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-07 19:02:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 19:02:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-07 19:02:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 19:02:33,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [97] 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:02:33,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {37#true} is VALID [2022-04-07 19:02:33,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 19:02:33,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 19:02:33,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 19:02:33,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {37#true} is VALID [2022-04-07 19:02:33,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {37#true} is VALID [2022-04-07 19:02:33,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {38#false} is VALID [2022-04-07 19:02:33,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {38#false} is VALID [2022-04-07 19:02:33,408 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {37#true} is VALID [2022-04-07 19:02:33,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,410 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {38#false} is VALID [2022-04-07 19:02:33,411 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-07 19:02:33,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,414 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 19:02:33,414 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-07 19:02:33,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} [105] assume_abort_if_notENTRY-->L16: 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] {37#true} is VALID [2022-04-07 19:02:33,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,417 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-07 19:02:33,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {38#false} is VALID [2022-04-07 19:02:33,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} [113] L37-2-->L46-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} [116] L46-2-->L41-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,421 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} [121] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {38#false} is VALID [2022-04-07 19:02:33,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} [124] __VERIFIER_assertENTRY-->L19: 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] {38#false} is VALID [2022-04-07 19:02:33,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} [128] L19-->L20: 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[] {38#false} is VALID [2022-04-07 19:02:33,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-07 19:02:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:02:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:02:33,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930637839] [2022-04-07 19:02:33,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930637839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:02:33,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:02:33,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:02:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270707699] [2022-04-07 19:02:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:02:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 19:02:33,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:02:33,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:02:33,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:33,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:02:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:02:33,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:02:33,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:02:33,524 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:02:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:33,671 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-07 19:02:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:02:33,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 19:02:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:02:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:02:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-07 19:02:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:02:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-07 19:02:33,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-07 19:02:33,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:33,779 INFO L225 Difference]: With dead ends: 34 [2022-04-07 19:02:33,779 INFO L226 Difference]: Without dead ends: 29 [2022-04-07 19:02:33,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:02:33,784 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:02:33,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:02:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-07 19:02:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-07 19:02:33,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:02:33,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:02:33,812 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:02:33,813 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:02:33,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:33,818 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 19:02:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 19:02:33,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:33,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:33,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 19:02:33,820 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-07 19:02:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:33,825 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-07 19:02:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 19:02:33,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:33,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:33,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:02:33,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:02:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:02:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-07 19:02:33,831 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-07 19:02:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:02:33,831 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-07 19:02:33,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:02:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-07 19:02:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 19:02:33,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:33,833 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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:02:33,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:02:33,834 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1131459816, now seen corresponding path program 1 times [2022-04-07 19:02:33,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:33,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792489721] [2022-04-07 19:02:33,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:33,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:33,871 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:02:33,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563275963] [2022-04-07 19:02:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:33,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:33,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:33,879 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:02:33,889 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:02:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 19:02:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:33,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:02:35,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {182#true} is VALID [2022-04-07 19:02:35,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {182#true} is VALID [2022-04-07 19:02:35,246 INFO L272 TraceCheckUtils]: 6: Hoare triple {182#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {182#true} is VALID [2022-04-07 19:02:35,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {182#true} {182#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {182#true} is VALID [2022-04-07 19:02:35,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {182#true} is VALID [2022-04-07 19:02:35,247 INFO L272 TraceCheckUtils]: 12: Hoare triple {182#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {182#true} is VALID [2022-04-07 19:02:35,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {226#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:02:35,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {226#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {230#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:35,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {230#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:35,249 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {230#(not (= |assume_abort_if_not_#in~cond| 0))} {182#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {237#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-07 19:02:35,249 INFO L272 TraceCheckUtils]: 17: Hoare triple {237#(<= (mod main_~B~0 4294967296) 5)} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {182#true} is VALID [2022-04-07 19:02:35,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,251 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {182#true} {237#(<= (mod main_~B~0 4294967296) 5)} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {237#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-07 19:02:35,251 INFO L272 TraceCheckUtils]: 22: Hoare triple {237#(<= (mod main_~B~0 4294967296) 5)} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {182#true} is VALID [2022-04-07 19:02:35,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,253 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {182#true} {237#(<= (mod main_~B~0 4294967296) 5)} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {237#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-07 19:02:35,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {237#(<= (mod main_~B~0 4294967296) 5)} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {271#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} is VALID [2022-04-07 19:02:35,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {271#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} is VALID [2022-04-07 19:02:35,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {271#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {278#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} is VALID [2022-04-07 19:02:35,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {278#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} is VALID [2022-04-07 19:02:35,258 INFO L272 TraceCheckUtils]: 31: Hoare triple {278#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 5))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:02:35,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {285#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:02:35,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {289#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {183#false} is VALID [2022-04-07 19:02:35,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {183#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-07 19:02:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 19:02:35,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:02:35,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {183#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-07 19:02:35,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {289#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {183#false} is VALID [2022-04-07 19:02:35,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {285#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:02:35,744 INFO L272 TraceCheckUtils]: 31: Hoare triple {305#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:02:35,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {305#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {305#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 19:02:35,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {312#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {305#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 19:02:35,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {312#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:02:35,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {182#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {312#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-07 19:02:35,747 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {182#true} {182#true} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {182#true} is VALID [2022-04-07 19:02:35,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,748 INFO L272 TraceCheckUtils]: 22: Hoare triple {182#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {182#true} is VALID [2022-04-07 19:02:35,748 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {182#true} {182#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {182#true} is VALID [2022-04-07 19:02:35,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,749 INFO L272 TraceCheckUtils]: 17: Hoare triple {182#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {182#true} is VALID [2022-04-07 19:02:35,749 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {182#true} {182#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {182#true} is VALID [2022-04-07 19:02:35,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,750 INFO L272 TraceCheckUtils]: 12: Hoare triple {182#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {182#true} is VALID [2022-04-07 19:02:35,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {182#true} is VALID [2022-04-07 19:02:35,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {182#true} {182#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {182#true} is VALID [2022-04-07 19:02:35,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#true} [108] L16-->L16-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[] {182#true} is VALID [2022-04-07 19:02:35,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#true} [105] assume_abort_if_notENTRY-->L16: 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] {182#true} is VALID [2022-04-07 19:02:35,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {182#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {182#true} is VALID [2022-04-07 19:02:35,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {182#true} is VALID [2022-04-07 19:02:35,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {182#true} is VALID [2022-04-07 19:02:35,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-07 19:02:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:02:35,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:02:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792489721] [2022-04-07 19:02:35,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:02:35,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563275963] [2022-04-07 19:02:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563275963] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:02:35,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:02:35,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-07 19:02:35,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97670572] [2022-04-07 19:02:35,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:02:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-07 19:02:35,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:02:35,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:35,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:35,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:02:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:02:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:02:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:02:35,781 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:37,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 19:02:39,496 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:02:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:39,676 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-07 19:02:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:02:39,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-07 19:02:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:02:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-07 19:02:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-07 19:02:39,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-07 19:02:39,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:39,761 INFO L225 Difference]: With dead ends: 39 [2022-04-07 19:02:39,761 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 19:02:39,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:02:39,762 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-07 19:02:39,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-07 19:02:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 19:02:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-07 19:02:39,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:02:39,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:39,769 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:39,769 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:39,773 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-07 19:02:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 19:02:39,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:39,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:39,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-07 19:02:39,775 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-07 19:02:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:39,779 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-07 19:02:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 19:02:39,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:39,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:39,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:02:39,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:02:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-07 19:02:39,784 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-07 19:02:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:02:39,785 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-07 19:02:39,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 19:02:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-07 19:02:39,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:39,786 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 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:02:39,815 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:02:40,012 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:40,012 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash -305154333, now seen corresponding path program 1 times [2022-04-07 19:02:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:40,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145718701] [2022-04-07 19:02:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:40,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:02:40,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028342939] [2022-04-07 19:02:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:40,051 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:02:40,086 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:02:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:40,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 19:02:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:40,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:02:41,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {557#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:41,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {557#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {557#true} is VALID [2022-04-07 19:02:41,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {557#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:41,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:41,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:41,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {557#true} is VALID [2022-04-07 19:02:41,585 INFO L272 TraceCheckUtils]: 6: Hoare triple {557#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {557#true} is VALID [2022-04-07 19:02:41,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {583#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:02:41,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {583#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:41,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {587#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:41,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {587#(not (= |assume_abort_if_not_#in~cond| 0))} {557#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {594#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:41,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(<= (mod main_~A~0 4294967296) 5)} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {594#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:41,588 INFO L272 TraceCheckUtils]: 12: Hoare triple {594#(<= (mod main_~A~0 4294967296) 5)} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {557#true} is VALID [2022-04-07 19:02:41,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {557#true} is VALID [2022-04-07 19:02:41,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {557#true} [108] L16-->L16-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[] {557#true} is VALID [2022-04-07 19:02:41,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:41,589 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {557#true} {594#(<= (mod main_~A~0 4294967296) 5)} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {594#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:41,590 INFO L272 TraceCheckUtils]: 17: Hoare triple {594#(<= (mod main_~A~0 4294967296) 5)} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {557#true} is VALID [2022-04-07 19:02:41,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {557#true} is VALID [2022-04-07 19:02:41,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {557#true} [108] L16-->L16-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[] {557#true} is VALID [2022-04-07 19:02:41,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:41,591 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {557#true} {594#(<= (mod main_~A~0 4294967296) 5)} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {594#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:41,591 INFO L272 TraceCheckUtils]: 22: Hoare triple {594#(<= (mod main_~A~0 4294967296) 5)} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {557#true} is VALID [2022-04-07 19:02:41,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {583#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:02:41,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {583#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:41,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {587#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:41,595 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#(not (= |assume_abort_if_not_#in~cond| 0))} {594#(<= (mod main_~A~0 4294967296) 5)} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {643#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~A~0 4294967296) 5))} is VALID [2022-04-07 19:02:41,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~A~0 4294967296) 5))} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {647#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:41,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {647#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {647#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:41,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {647#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:41,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:41,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:41,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:41,608 INFO L272 TraceCheckUtils]: 33: Hoare triple {654#(and (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {667#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:02:41,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {667#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {671#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:02:41,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {671#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {558#false} is VALID [2022-04-07 19:02:41,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {558#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {558#false} is VALID [2022-04-07 19:02:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:02:41,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:02:42,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {558#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {558#false} is VALID [2022-04-07 19:02:42,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {671#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {558#false} is VALID [2022-04-07 19:02:42,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {667#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {671#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:02:42,638 INFO L272 TraceCheckUtils]: 33: Hoare triple {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {667#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:02:42,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 19:02:42,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 19:02:42,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 19:02:42,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {700#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {687#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-07 19:02:42,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {700#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {700#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 19:02:42,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {557#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {700#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-07 19:02:42,661 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {557#true} {557#true} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {557#true} is VALID [2022-04-07 19:02:42,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {557#true} [108] L16-->L16-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[] {557#true} is VALID [2022-04-07 19:02:42,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {557#true} is VALID [2022-04-07 19:02:42,661 INFO L272 TraceCheckUtils]: 22: Hoare triple {557#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {557#true} is VALID [2022-04-07 19:02:42,661 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {557#true} {557#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {557#true} [108] L16-->L16-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[] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L272 TraceCheckUtils]: 17: Hoare triple {557#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {557#true} {557#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {557#true} [108] L16-->L16-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[] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L272 TraceCheckUtils]: 12: Hoare triple {557#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {557#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {557#true} {557#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {557#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {557#true} [108] L16-->L16-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[] {557#true} is VALID [2022-04-07 19:02:42,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {557#true} [105] assume_abort_if_notENTRY-->L16: 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] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L272 TraceCheckUtils]: 6: Hoare triple {557#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {557#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {557#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {557#true} is VALID [2022-04-07 19:02:42,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {557#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-07 19:02:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:02:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:02:42,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145718701] [2022-04-07 19:02:42,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:02:42,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028342939] [2022-04-07 19:02:42,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028342939] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:02:42,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:02:42,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-07 19:02:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931106248] [2022-04-07 19:02:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:02:42,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-07 19:02:42,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:02:42,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:44,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:44,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:02:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:02:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:02:44,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:02:44,728 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:44,994 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 19:02:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:02:44,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-07 19:02:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:02:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 19:02:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-07 19:02:45,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-07 19:02:47,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:47,077 INFO L225 Difference]: With dead ends: 44 [2022-04-07 19:02:47,077 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 19:02:47,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-07 19:02:47,078 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:02:47,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-04-07 19:02:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 19:02:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 19:02:47,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:02:47,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:02:47,085 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:02:47,085 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:02:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:47,088 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 19:02:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 19:02:47,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:47,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:47,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-07 19:02:47,090 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-07 19:02:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:47,094 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 19:02:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 19:02:47,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:47,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:47,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:02:47,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:02:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-07 19:02:47,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-07 19:02:47,100 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-07 19:02:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:02:47,101 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-07 19:02:47,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:02:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 19:02:47,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 19:02:47,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:47,103 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 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] [2022-04-07 19:02:47,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 19:02:47,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 19:02:47,312 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1858557484, now seen corresponding path program 1 times [2022-04-07 19:02:47,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:47,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137300533] [2022-04-07 19:02:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:47,341 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:02:47,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389484231] [2022-04-07 19:02:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:47,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:47,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:47,343 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:02:47,362 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:02:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:47,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 19:02:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:47,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:02:47,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {968#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {968#true} is VALID [2022-04-07 19:02:47,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {968#true} {968#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {968#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {968#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {968#true} [105] assume_abort_if_notENTRY-->L16: 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] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#true} [108] L16-->L16-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[] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {968#true} {968#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {968#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {968#true} is VALID [2022-04-07 19:02:47,527 INFO L272 TraceCheckUtils]: 12: Hoare triple {968#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {968#true} [105] assume_abort_if_notENTRY-->L16: 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] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#true} [108] L16-->L16-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[] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {968#true} {968#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L272 TraceCheckUtils]: 17: Hoare triple {968#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {968#true} [105] assume_abort_if_notENTRY-->L16: 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] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {968#true} [108] L16-->L16-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[] {968#true} is VALID [2022-04-07 19:02:47,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,529 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {968#true} {968#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {968#true} is VALID [2022-04-07 19:02:47,529 INFO L272 TraceCheckUtils]: 22: Hoare triple {968#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {968#true} is VALID [2022-04-07 19:02:47,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {968#true} [105] assume_abort_if_notENTRY-->L16: 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] {968#true} is VALID [2022-04-07 19:02:47,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {968#true} [108] L16-->L16-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[] {968#true} is VALID [2022-04-07 19:02:47,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {968#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,529 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {968#true} {968#true} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {968#true} is VALID [2022-04-07 19:02:47,530 INFO L290 TraceCheckUtils]: 27: Hoare triple {968#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 19:02:47,530 INFO L290 TraceCheckUtils]: 28: Hoare triple {1054#(= main_~B~0 main_~b~0)} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 19:02:47,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {1054#(= main_~B~0 main_~b~0)} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 19:02:47,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {1054#(= main_~B~0 main_~b~0)} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 19:02:47,531 INFO L272 TraceCheckUtils]: 31: Hoare triple {1054#(= main_~B~0 main_~b~0)} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {968#true} is VALID [2022-04-07 19:02:47,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {968#true} [124] __VERIFIER_assertENTRY-->L19: 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] {968#true} is VALID [2022-04-07 19:02:47,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {968#true} [129] L19-->L19-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[] {968#true} is VALID [2022-04-07 19:02:47,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {968#true} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-07 19:02:47,532 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {968#true} {1054#(= main_~B~0 main_~b~0)} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1054#(= main_~B~0 main_~b~0)} is VALID [2022-04-07 19:02:47,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {1054#(= main_~B~0 main_~b~0)} [126] L42-1-->L46: Formula: (let ((.cse0 (mod v_main_~b~0_8 4294967296))) (and (= v_main_~q~0_3 (* v_main_~q~0_4 2)) (= v_main_~b~0_7 (div .cse0 2)) (not (= .cse0 (mod v_main_~B~0_7 4294967296))))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_8} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {969#false} is VALID [2022-04-07 19:02:47,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#false} [130] L46-->L46-2: Formula: (and (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_7 4294967296)) (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_6 (+ v_main_~r~0_7 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_7} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {969#false} is VALID [2022-04-07 19:02:47,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#false} is VALID [2022-04-07 19:02:47,533 INFO L272 TraceCheckUtils]: 39: Hoare triple {969#false} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {969#false} is VALID [2022-04-07 19:02:47,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#false} [124] __VERIFIER_assertENTRY-->L19: 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] {969#false} is VALID [2022-04-07 19:02:47,534 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#false} [128] L19-->L20: 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[] {969#false} is VALID [2022-04-07 19:02:47,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#false} is VALID [2022-04-07 19:02:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:02:47,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:02:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:02:47,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137300533] [2022-04-07 19:02:47,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:02:47,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389484231] [2022-04-07 19:02:47,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389484231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:02:47,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:02:47,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:02:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959705326] [2022-04-07 19:02:47,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:02:47,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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 43 [2022-04-07 19:02:47,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:02:47,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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:02:47,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:47,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:02:47,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:02:47,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:02:47,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:02:47,572 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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:02:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:47,663 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 19:02:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:02:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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 43 [2022-04-07 19:02:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:02:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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:02:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-07 19:02:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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:02:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-07 19:02:47,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-07 19:02:47,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:47,716 INFO L225 Difference]: With dead ends: 44 [2022-04-07 19:02:47,716 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 19:02:47,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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:02:47,717 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:02:47,718 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:02:47,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 19:02:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-07 19:02:47,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:02:47,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:47,724 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:47,724 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:47,726 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 19:02:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 19:02:47,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:47,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:47,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-07 19:02:47,728 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-07 19:02:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:47,730 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-07 19:02:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 19:02:47,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:47,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:47,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:02:47,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:02:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-07 19:02:47,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-07 19:02:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:02:47,734 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-07 19:02:47,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 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:02:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 19:02:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 19:02:47,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:47,736 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-07 19:02:47,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 19:02:47,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:47,956 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1983451131, now seen corresponding path program 1 times [2022-04-07 19:02:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:47,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327933949] [2022-04-07 19:02:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:47,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:02:47,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571982891] [2022-04-07 19:02:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:47,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:47,988 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:02:48,008 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:02:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:48,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 19:02:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:48,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:02:48,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {1254#true} is VALID [2022-04-07 19:02:48,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1254#true} is VALID [2022-04-07 19:02:48,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1254#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1254#true} {1254#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {1254#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:48,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L272 TraceCheckUtils]: 17: Hoare triple {1254#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,419 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1254#true} {1254#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L272 TraceCheckUtils]: 22: Hoare triple {1254#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1254#true} {1254#true} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {1254#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {1254#true} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {1254#true} is VALID [2022-04-07 19:02:48,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {1254#true} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {1254#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:48,421 INFO L272 TraceCheckUtils]: 33: Hoare triple {1254#true} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1254#true} is VALID [2022-04-07 19:02:48,422 INFO L290 TraceCheckUtils]: 34: Hoare triple {1254#true} [124] __VERIFIER_assertENTRY-->L19: 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] {1361#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:02:48,422 INFO L290 TraceCheckUtils]: 35: Hoare triple {1361#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [129] L19-->L19-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[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:02:48,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:02:48,423 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} {1254#true} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 19:02:48,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [125] L42-1-->L41-1: Formula: (= (mod v_main_~b~0_6 4294967296) (mod v_main_~B~0_4 4294967296)) InVars {main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} OutVars{main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} AuxVars[] AssignedVars[] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 19:02:48,425 INFO L272 TraceCheckUtils]: 39: Hoare triple {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [121] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1379#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 19:02:48,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {1379#(= |__VERIFIER_assert_#in~cond| 1)} [124] __VERIFIER_assertENTRY-->L19: 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] {1383#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 19:02:48,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {1383#(= __VERIFIER_assert_~cond 1)} [128] L19-->L20: 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[] {1255#false} is VALID [2022-04-07 19:02:48,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {1255#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1255#false} is VALID [2022-04-07 19:02:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 19:02:48,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:02:50,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {1255#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1255#false} is VALID [2022-04-07 19:02:50,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {1393#(not (= __VERIFIER_assert_~cond 0))} [128] L19-->L20: 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[] {1255#false} is VALID [2022-04-07 19:02:50,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] __VERIFIER_assertENTRY-->L19: 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] {1393#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:02:50,059 INFO L272 TraceCheckUtils]: 39: Hoare triple {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [121] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:02:50,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [125] L42-1-->L41-1: Formula: (= (mod v_main_~b~0_6 4294967296) (mod v_main_~B~0_4 4294967296)) InVars {main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} OutVars{main_~b~0=v_main_~b~0_6, main_~B~0=v_main_~B~0_4} AuxVars[] AssignedVars[] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 19:02:50,060 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} {1254#true} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1372#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-07 19:02:50,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:02:50,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {1415#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [129] L19-->L19-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[] {1365#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {1254#true} [124] __VERIFIER_assertENTRY-->L19: 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] {1415#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:02:50,062 INFO L272 TraceCheckUtils]: 33: Hoare triple {1254#true} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1254#true} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {1254#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {1254#true} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {1254#true} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {1254#true} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {1254#true} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1254#true} {1254#true} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L272 TraceCheckUtils]: 22: Hoare triple {1254#true} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1254#true} {1254#true} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:50,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L272 TraceCheckUtils]: 17: Hoare triple {1254#true} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1254#true} {1254#true} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L272 TraceCheckUtils]: 12: Hoare triple {1254#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#true} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {1254#true} is VALID [2022-04-07 19:02:50,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1254#true} {1254#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1254#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1254#true} [108] L16-->L16-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[] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {1254#true} [105] assume_abort_if_notENTRY-->L16: 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] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {1254#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1254#true} {1254#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {1254#true} is VALID [2022-04-07 19:02:50,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {1254#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-07 19:02:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-07 19:02:50,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:02:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327933949] [2022-04-07 19:02:50,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:02:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571982891] [2022-04-07 19:02:50,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571982891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:02:50,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:02:50,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-07 19:02:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070102293] [2022-04-07 19:02:50,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:02:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-07 19:02:50,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:02:50,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 19:02:50,101 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:02:50,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:02:50,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:02:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:02:50,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:02:50,102 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 19:02:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:53,445 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-07 19:02:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 19:02:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-07 19:02:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:02:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 19:02:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-07 19:02:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 19:02:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-07 19:02:53,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-07 19:02:53,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:53,499 INFO L225 Difference]: With dead ends: 41 [2022-04-07 19:02:53,499 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 19:02:53,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:02:53,500 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 19:02:53,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 19:02:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 19:02:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 19:02:53,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:02:53,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:53,504 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:53,504 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:53,506 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 19:02:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 19:02:53,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:53,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:53,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 19:02:53,512 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 19:02:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:53,520 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-07 19:02:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 19:02:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:53,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:02:53,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:02:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:02:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-07 19:02:53,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-07 19:02:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:02:53,525 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-07 19:02:53,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-07 19:02:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-07 19:02:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 19:02:53,527 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:53,527 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 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] [2022-04-07 19:02:53,549 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:02:53,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:53,727 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:53,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash 270500047, now seen corresponding path program 1 times [2022-04-07 19:02:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:53,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768450221] [2022-04-07 19:02:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:53,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:02:53,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111751929] [2022-04-07 19:02:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:53,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:53,751 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:02:53,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 19:02:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:53,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 19:02:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:02:53,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:02:54,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {1673#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1673#true} [99] 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) (= (select |v_#length_1| 2) 9) (= (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] {1673#true} is VALID [2022-04-07 19:02:54,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1673#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1673#true} {1673#true} [135] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {1673#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {1673#true} [101] mainENTRY-->L29: Formula: (= v_main_~A~0_1 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~b~0=v_main_~b~0_4, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1673#true} is VALID [2022-04-07 19:02:54,684 INFO L272 TraceCheckUtils]: 6: Hoare triple {1673#true} [103] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {1673#true} is VALID [2022-04-07 19:02:54,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {1673#true} [105] assume_abort_if_notENTRY-->L16: 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] {1699#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:02:54,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {1699#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [108] L16-->L16-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[] {1703#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:54,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {1703#(not (= |assume_abort_if_not_#in~cond| 0))} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1703#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:02:54,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1703#(not (= |assume_abort_if_not_#in~cond| 0))} {1673#true} [136] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} 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] {1710#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:54,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {1710#(<= (mod main_~A~0 4294967296) 5)} [104] L29-1-->L31: Formula: (= v_main_~B~0_2 |v_main_#t~nondet2_2|) InVars {main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~B~0=v_main_~B~0_2} AuxVars[] AssignedVars[main_#t~nondet2, main_~B~0] {1710#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:54,687 INFO L272 TraceCheckUtils]: 12: Hoare triple {1710#(<= (mod main_~A~0 4294967296) 5)} [106] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {1673#true} is VALID [2022-04-07 19:02:54,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {1673#true} [105] assume_abort_if_notENTRY-->L16: 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] {1673#true} is VALID [2022-04-07 19:02:54,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {1673#true} [108] L16-->L16-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[] {1673#true} is VALID [2022-04-07 19:02:54,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {1673#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,688 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1673#true} {1710#(<= (mod main_~A~0 4294967296) 5)} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~B~0_9 4294967296) 5) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~B~0=v_main_~B~0_9} 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] {1710#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:54,688 INFO L272 TraceCheckUtils]: 17: Hoare triple {1710#(<= (mod main_~A~0 4294967296) 5)} [109] L31-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1673#true} is VALID [2022-04-07 19:02:54,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#true} [105] assume_abort_if_notENTRY-->L16: 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] {1673#true} is VALID [2022-04-07 19:02:54,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {1673#true} [108] L16-->L16-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[] {1673#true} is VALID [2022-04-07 19:02:54,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {1673#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,691 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1673#true} {1710#(<= (mod main_~A~0 4294967296) 5)} [138] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (mod v_main_~B~0_10 4294967296) 2147483647) 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_3|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1710#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:54,691 INFO L272 TraceCheckUtils]: 22: Hoare triple {1710#(<= (mod main_~A~0 4294967296) 5)} [111] L32-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_11 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1673#true} is VALID [2022-04-07 19:02:54,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {1673#true} [105] assume_abort_if_notENTRY-->L16: 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] {1673#true} is VALID [2022-04-07 19:02:54,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {1673#true} [108] L16-->L16-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[] {1673#true} is VALID [2022-04-07 19:02:54,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {1673#true} [110] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,692 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1673#true} {1710#(<= (mod main_~A~0 4294967296) 5)} [139] assume_abort_if_notEXIT-->L33: 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_4|) InVars {main_~B~0=v_main_~B~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1710#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-07 19:02:54,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {1710#(<= (mod main_~A~0 4294967296) 5)} [112] L33-->L37-2: Formula: (and (= v_main_~q~0_5 0) (= v_main_~A~0_6 v_main_~r~0_5) (= v_main_~B~0_8 v_main_~b~0_9)) InVars {main_~A~0=v_main_~A~0_6, main_~B~0=v_main_~B~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_8, main_~b~0=v_main_~b~0_9, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~r~0] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [120] L38-->L37-2: Formula: (and (<= (mod v_main_~b~0_3 4294967296) (mod v_main_~r~0_2 4294967296)) (= (* v_main_~b~0_3 2) v_main_~b~0_2)) InVars {main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} OutVars{main_~b~0=v_main_~b~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~b~0] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [119] L38-->L46-2: Formula: (not (<= (mod v_main_~b~0_1 4294967296) (mod v_main_~r~0_1 4294967296))) InVars {main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} OutVars{main_~b~0=v_main_~b~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,695 INFO L272 TraceCheckUtils]: 33: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1673#true} is VALID [2022-04-07 19:02:54,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {1673#true} [124] __VERIFIER_assertENTRY-->L19: 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] {1673#true} is VALID [2022-04-07 19:02:54,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {1673#true} [129] L19-->L19-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[] {1673#true} is VALID [2022-04-07 19:02:54,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {1673#true} [134] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1673#true} is VALID [2022-04-07 19:02:54,696 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1673#true} {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [141] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [126] L42-1-->L46: Formula: (let ((.cse0 (mod v_main_~b~0_8 4294967296))) (and (= v_main_~q~0_3 (* v_main_~q~0_4 2)) (= v_main_~b~0_7 (div .cse0 2)) (not (= .cse0 (mod v_main_~B~0_7 4294967296))))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_8} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_7, main_~b~0=v_main_~b~0_7} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-07 19:02:54,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {1762#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [130] L46-->L46-2: Formula: (and (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_7 4294967296)) (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_6 (+ v_main_~r~0_7 (* (- 1) v_main_~b~0_10)))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_7} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1799#(and (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 5) (= main_~A~0 (+ main_~b~0 main_~r~0)))} is VALID [2022-04-07 19:02:54,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {1799#(and (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 5) (= main_~A~0 (+ main_~b~0 main_~r~0)))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1799#(and (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 5) (= main_~A~0 (+ main_~b~0 main_~r~0)))} is VALID [2022-04-07 19:02:54,701 INFO L272 TraceCheckUtils]: 41: Hoare triple {1799#(and (= (+ (- 1) main_~q~0) 0) (<= (mod main_~A~0 4294967296) 5) (= main_~A~0 (+ main_~b~0 main_~r~0)))} [122] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1806#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:02:54,702 INFO L290 TraceCheckUtils]: 42: Hoare triple {1806#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L19: 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] {1810#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:02:54,703 INFO L290 TraceCheckUtils]: 43: Hoare triple {1810#(<= 1 __VERIFIER_assert_~cond)} [128] L19-->L20: 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[] {1674#false} is VALID [2022-04-07 19:02:54,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {1674#false} [132] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1674#false} is VALID [2022-04-07 19:02:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-07 19:02:54,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:02:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:02:57,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768450221] [2022-04-07 19:02:57,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:02:57,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111751929] [2022-04-07 19:02:57,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111751929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 19:02:57,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:02:57,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 19:02:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177404694] [2022-04-07 19:02:57,679 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 19:02:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2022-04-07 19:02:57,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:02:57,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:02:57,775 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:02:57,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:02:57,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:02:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:02:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2022-04-07 19:02:57,777 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:02:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:58,884 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-07 19:02:58,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 19:02:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2022-04-07 19:02:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:02:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:02:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-07 19:02:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:02:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2022-04-07 19:02:58,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 47 transitions. [2022-04-07 19:02:59,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:02:59,034 INFO L225 Difference]: With dead ends: 47 [2022-04-07 19:02:59,034 INFO L226 Difference]: Without dead ends: 47 [2022-04-07 19:02:59,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-04-07 19:02:59,035 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 19:02:59,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 19:02:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-07 19:02:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-07 19:02:59,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:02:59,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:02:59,041 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:02:59,042 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:02:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:59,044 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-07 19:02:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-07 19:02:59,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:59,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:59,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-07 19:02:59,045 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 47 states. [2022-04-07 19:02:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:02:59,048 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-07 19:02:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-07 19:02:59,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:02:59,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:02:59,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:02:59,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:02:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:02:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-04-07 19:02:59,051 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 45 [2022-04-07 19:02:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:02:59,051 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-04-07 19:02:59,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:02:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-04-07 19:02:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-07 19:02:59,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:02:59,052 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2022-04-07 19:02:59,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 19:02:59,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:59,258 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:02:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:02:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash -575889733, now seen corresponding path program 2 times [2022-04-07 19:02:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:02:59,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322372602] [2022-04-07 19:02:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:02:59,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:02:59,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:02:59,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1714586583] [2022-04-07 19:02:59,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 19:02:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:02:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:02:59,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:02:59,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process