/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_valuebound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:10:53,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:10:53,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:10:53,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:10:53,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:10:53,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:10:53,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:10:53,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:10:53,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:10:53,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:10:53,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:10:53,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:10:53,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:10:53,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:10:53,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:10:53,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:10:53,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:10:53,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:10:53,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:10:53,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:10:53,504 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:10:53,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:10:53,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:10:53,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:10:53,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:10:53,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:10:53,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:10:53,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:10:53,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:10:53,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:10:53,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:10:53,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:10:53,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:10:53,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:10:53,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:10:53,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:10:53,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:10:53,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:10:53,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:10:53,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:10:53,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:10:53,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:10:53,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:10:53,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:10:53,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:10:53,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:10:53,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:10:53,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:10:53,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:10:53,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:10:53,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:10:53,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:10:53,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:10:53,536 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:10:53,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:10:53,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:10:53,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:10:53,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:10:53,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:10:53,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:10:53,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:10:53,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:10:53,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:10:53,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:10:53,539 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:10:53,539 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 21:10:53,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:10:53,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:10:53,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:10:53,796 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:10:53,801 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:10:53,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound50.i [2022-04-14 21:10:53,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915cfbfe5/49cfe367725e4066af348fbabe4aa205/FLAG1137ff9bd [2022-04-14 21:10:54,205 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:10:54,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound50.i [2022-04-14 21:10:54,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915cfbfe5/49cfe367725e4066af348fbabe4aa205/FLAG1137ff9bd [2022-04-14 21:10:54,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915cfbfe5/49cfe367725e4066af348fbabe4aa205 [2022-04-14 21:10:54,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:10:54,224 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:10:54,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:10:54,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:10:54,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:10:54,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb5df2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54, skipping insertion in model container [2022-04-14 21:10:54,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:10:54,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:10:54,389 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_valuebound50.i[950,963] [2022-04-14 21:10:54,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:10:54,413 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:10:54,424 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_valuebound50.i[950,963] [2022-04-14 21:10:54,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:10:54,448 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:10:54,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54 WrapperNode [2022-04-14 21:10:54,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:10:54,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:10:54,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:10:54,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:10:54,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:10:54,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:10:54,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:10:54,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:10:54,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:10:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:10:54,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 21:10:54,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 21:10:54,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:10:54,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:10:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:10:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:10:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:10:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:10:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:10:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:10:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:10:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:10:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:10:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:10:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:10:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:10:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:10:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:10:54,622 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:10:54,624 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:10:54,790 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:10:54,797 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:10:54,797 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 21:10:54,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:10:54 BoogieIcfgContainer [2022-04-14 21:10:54,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:10:54,799 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:10:54,800 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:10:54,801 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:10:54,803 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:10:54" (1/1) ... [2022-04-14 21:10:54,805 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:10:54,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:10:54 BasicIcfg [2022-04-14 21:10:54,849 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:10:54,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:10:54,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:10:54,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:10:54,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:10:54" (1/4) ... [2022-04-14 21:10:54,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2482a51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:10:54, skipping insertion in model container [2022-04-14 21:10:54,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:10:54" (2/4) ... [2022-04-14 21:10:54,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2482a51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:10:54, skipping insertion in model container [2022-04-14 21:10:54,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:10:54" (3/4) ... [2022-04-14 21:10:54,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2482a51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:10:54, skipping insertion in model container [2022-04-14 21:10:54,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:10:54" (4/4) ... [2022-04-14 21:10:54,873 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound50.iJordan [2022-04-14 21:10:54,878 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:10:54,878 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:10:54,912 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:10:54,918 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 21:10:54,919 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:10:54,936 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-14 21:10:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 21:10:54,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:10:54,944 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-14 21:10:54,944 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:10:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:10:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -402483300, now seen corresponding path program 1 times [2022-04-14 21:10:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:10:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318166540] [2022-04-14 21:10:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:10:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:10:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:10:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,177 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-14 21:10:55,178 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-14 21:10:55,178 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-14 21:10:55,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:10:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,202 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-14 21:10:55,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,204 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-14 21:10:55,204 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) 50) 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-14 21:10:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 21:10:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,224 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-14 21:10:55,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,226 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-14 21:10:55,226 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:10:55,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 21:10:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,236 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-14 21:10:55,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,237 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-14 21:10:55,239 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-14 21:10:55,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 21:10:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,260 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-14 21:10:55,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,261 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-14 21:10:55,262 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-14 21:10:55,264 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-14 21:10:55,264 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-14 21:10:55,265 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-14 21:10:55,265 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-14 21:10:55,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 21:10:55,267 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-14 21:10:55,267 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) 50) 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-14 21:10:55,268 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-14 21:10:55,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,269 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-14 21:10:55,270 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) 50) 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-14 21:10:55,270 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-14 21:10:55,271 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:10:55,271 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-14 21:10:55,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,272 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-14 21:10:55,273 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:10:55,273 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-14 21:10:55,275 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-14 21:10:55,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,276 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-14 21:10:55,276 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-14 21:10:55,276 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-14 21:10:55,276 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-14 21:10:55,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} [107] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 21:10:55,277 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-14 21:10:55,279 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-14 21:10:55,280 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-14 21:10:55,283 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-14 21:10:55,283 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-14 21:10:55,284 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-14 21:10:55,284 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-14 21:10:55,285 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-14 21:10:55,286 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-14 21:10:55,287 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-14 21:10:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:10:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318166540] [2022-04-14 21:10:55,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318166540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:10:55,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:10:55,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 21:10:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772046334] [2022-04-14 21:10:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:10:55,297 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-14 21:10:55,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:10:55,303 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-14 21:10:55,344 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-14 21:10:55,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 21:10:55,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:10:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 21:10:55,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:10:55,382 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-14 21:10:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:10:55,532 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-14 21:10:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 21:10:55,533 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-14 21:10:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:10:55,535 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-14 21:10:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-14 21:10:55,542 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-14 21:10:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-14 21:10:55,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-14 21:10:55,618 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-14 21:10:55,626 INFO L225 Difference]: With dead ends: 34 [2022-04-14 21:10:55,626 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 21:10:55,628 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-14 21:10:55,631 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-14 21:10:55,632 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-14 21:10:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 21:10:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 21:10:55,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:10:55,658 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-14 21:10:55,658 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-14 21:10:55,659 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-14 21:10:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:10:55,664 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-14 21:10:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-14 21:10:55,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:10:55,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:10:55,665 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-14 21:10:55,666 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-14 21:10:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:10:55,670 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-14 21:10:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-14 21:10:55,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:10:55,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:10:55,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:10:55,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:10:55,672 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-14 21:10:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-14 21:10:55,675 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-14 21:10:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:10:55,676 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-14 21:10:55,676 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-14 21:10:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-14 21:10:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 21:10:55,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:10:55,677 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-14 21:10:55,678 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 21:10:55,678 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:10:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:10:55,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1131459816, now seen corresponding path program 1 times [2022-04-14 21:10:55,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:10:55,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975181129] [2022-04-14 21:10:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:10:55,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:10:55,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:10:55,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [331680137] [2022-04-14 21:10:55,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:10:55,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:10:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:10:55,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:10:55,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 21:10:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-14 21:10:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:10:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:10:56,980 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-14 21:10:56,981 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-14 21:10:56,981 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-14 21:10:56,981 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-14 21:10:56,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-14 21:10:56,982 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-14 21:10:56,982 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) 50) 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-14 21:10:56,982 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-14 21:10:56,982 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-14 21:10:56,983 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-14 21:10:56,983 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) 50) 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-14 21:10:56,983 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-14 21:10:56,983 INFO L272 TraceCheckUtils]: 12: Hoare triple {182#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:10:56,984 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-14 21:10:56,985 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-14 21:10:56,985 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-14 21:10:56,986 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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) 50)} is VALID [2022-04-14 21:10:56,987 INFO L272 TraceCheckUtils]: 17: Hoare triple {237#(<= (mod main_~B~0 4294967296) 50)} [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-14 21:10:56,987 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-14 21:10:56,988 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-14 21:10:56,988 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-14 21:10:56,989 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {182#true} {237#(<= (mod main_~B~0 4294967296) 50)} [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) 50)} is VALID [2022-04-14 21:10:56,989 INFO L272 TraceCheckUtils]: 22: Hoare triple {237#(<= (mod main_~B~0 4294967296) 50)} [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-14 21:10:56,989 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-14 21:10:56,989 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-14 21:10:56,989 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-14 21:10:56,990 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {182#true} {237#(<= (mod main_~B~0 4294967296) 50)} [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) 50)} is VALID [2022-04-14 21:10:56,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {237#(<= (mod main_~B~0 4294967296) 50)} [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 (<= (mod main_~b~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:10:56,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {271#(and (<= (mod main_~b~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {271#(and (<= (mod main_~b~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:10:56,992 INFO L290 TraceCheckUtils]: 29: Hoare triple {271#(and (<= (mod main_~b~0 4294967296) 50) (= main_~A~0 main_~r~0) (= 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[] {278#(and (<= (mod main_~b~0 4294967296) 50) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:10:56,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {278#(and (<= (mod main_~b~0 4294967296) 50) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#(and (<= (mod main_~b~0 4294967296) 50) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:10:56,994 INFO L272 TraceCheckUtils]: 31: Hoare triple {278#(and (<= (mod main_~b~0 4294967296) 50) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= 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] {285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:10:56,995 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-14 21:10:56,996 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-14 21:10:56,996 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-14 21:10:56,996 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-14 21:10:56,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:10:57,428 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-14 21:10:57,428 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-14 21:10:57,429 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-14 21:10:57,430 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-14 21:10:57,430 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-14 21:10:57,431 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-14 21:10:57,432 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-14 21:10:57,433 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-14 21:10:57,433 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-14 21:10:57,434 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-14 21:10:57,434 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-14 21:10:57,434 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-14 21:10:57,434 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-14 21:10:57,434 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-14 21:10:57,434 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-14 21:10:57,435 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-14 21:10:57,435 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-14 21:10:57,435 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-14 21:10:57,435 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:10:57,435 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-14 21:10:57,436 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-14 21:10:57,436 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-14 21:10:57,436 INFO L272 TraceCheckUtils]: 12: Hoare triple {182#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:10:57,436 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-14 21:10:57,436 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) 50) 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-14 21:10:57,437 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-14 21:10:57,437 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-14 21:10:57,437 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-14 21:10:57,437 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) 50) 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-14 21:10:57,437 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-14 21:10:57,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-14 21:10:57,438 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-14 21:10:57,438 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-14 21:10:57,438 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-14 21:10:57,438 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-14 21:10:57,439 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-14 21:10:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:10:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975181129] [2022-04-14 21:10:57,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:10:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331680137] [2022-04-14 21:10:57,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331680137] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 21:10:57,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 21:10:57,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-14 21:10:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350581611] [2022-04-14 21:10:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:10:57,441 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-14 21:10:57,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:10:57,453 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-14 21:10:57,527 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-14 21:10:57,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:10:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:10:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:10:57,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-14 21:10:57,529 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-14 21:11:00,189 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-14 21:11:02,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 21:11:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:02,451 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-14 21:11:02,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:11:02,451 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-14 21:11:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:11:02,452 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-14 21:11:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-14 21:11:02,454 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-14 21:11:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-14 21:11:02,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-14 21:11:02,517 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-14 21:11:02,519 INFO L225 Difference]: With dead ends: 39 [2022-04-14 21:11:02,519 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 21:11:02,519 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-14 21:11:02,520 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-14 21:11:02,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-04-14 21:11:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 21:11:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 21:11:02,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:11:02,527 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-14 21:11:02,528 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-14 21:11:02,530 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-14 21:11:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:02,537 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-14 21:11:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 21:11:02,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:02,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:02,538 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-14 21:11:02,539 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-14 21:11:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:02,542 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-14 21:11:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 21:11:02,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:02,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:02,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:11:02,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:11:02,543 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-14 21:11:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-14 21:11:02,545 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-14 21:11:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:11:02,546 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-14 21:11:02,546 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-14 21:11:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-14 21:11:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 21:11:02,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:11:02,551 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-14 21:11:02,590 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-14 21:11:02,768 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-14 21:11:02,769 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:11:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:11:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -305154333, now seen corresponding path program 1 times [2022-04-14 21:11:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:11:02,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072449269] [2022-04-14 21:11:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:11:02,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:11:02,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391648991] [2022-04-14 21:11:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:02,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:11:02,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:11:02,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:11:02,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 21:11:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:11:02,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 21:11:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:11:02,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:11:04,158 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-14 21:11:04,159 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-14 21:11:04,159 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-14 21:11:04,159 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-14 21:11:04,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-14 21:11:04,159 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-14 21:11:04,160 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) 50) 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-14 21:11:04,160 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-14 21:11:04,161 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-14 21:11:04,161 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-14 21:11:04,162 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) 50) 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) 50)} is VALID [2022-04-14 21:11:04,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {594#(<= (mod main_~A~0 4294967296) 50)} [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) 50)} is VALID [2022-04-14 21:11:04,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {594#(<= (mod main_~A~0 4294967296) 50)} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:04,162 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-14 21:11:04,163 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-14 21:11:04,163 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-14 21:11:04,164 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {557#true} {594#(<= (mod main_~A~0 4294967296) 50)} [137] assume_abort_if_notEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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) 50)} is VALID [2022-04-14 21:11:04,164 INFO L272 TraceCheckUtils]: 17: Hoare triple {594#(<= (mod main_~A~0 4294967296) 50)} [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-14 21:11:04,164 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-14 21:11:04,164 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-14 21:11:04,164 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-14 21:11:04,165 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {557#true} {594#(<= (mod main_~A~0 4294967296) 50)} [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) 50)} is VALID [2022-04-14 21:11:04,165 INFO L272 TraceCheckUtils]: 22: Hoare triple {594#(<= (mod main_~A~0 4294967296) 50)} [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-14 21:11:04,166 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-14 21:11:04,166 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-14 21:11:04,167 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-14 21:11:04,169 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {587#(not (= |assume_abort_if_not_#in~cond| 0))} {594#(<= (mod main_~A~0 4294967296) 50)} [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 (<= (mod main_~A~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-14 21:11:04,170 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(and (<= (mod main_~A~0 4294967296) 50) (<= 1 (mod main_~B~0 4294967296)))} [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 (<= (mod main_~A~0 4294967296) 50) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 21:11:04,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {647#(and (<= (mod main_~A~0 4294967296) 50) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {647#(and (<= (mod main_~A~0 4294967296) 50) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 21:11:04,177 INFO L290 TraceCheckUtils]: 29: Hoare triple {647#(and (<= (mod main_~A~0 4294967296) 50) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= 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 (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:11:04,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {654#(and (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:11:04,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {654#(and (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= 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 (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:11:04,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {654#(and (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {654#(and (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:11:04,181 INFO L272 TraceCheckUtils]: 33: Hoare triple {654#(and (<= (mod main_~A~0 4294967296) 50) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= 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-14 21:11:04,182 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-14 21:11:04,182 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-14 21:11:04,182 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-14 21:11:04,183 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-14 21:11:04,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:11:05,014 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-14 21:11:05,015 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-14 21:11:05,015 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-14 21:11:05,018 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-14 21:11:05,018 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-14 21:11:05,019 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-14 21:11:05,020 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-14 21:11:05,021 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-14 21:11:05,034 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-14 21:11:05,036 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-14 21:11:05,036 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-14 21:11:05,036 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-14 21:11:05,037 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-14 21:11:05,037 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-14 21:11:05,037 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-14 21:11:05,037 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-14 21:11:05,037 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-14 21:11:05,037 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-14 21:11:05,037 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-14 21:11:05,038 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-14 21:11:05,038 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:05,038 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-14 21:11:05,038 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-14 21:11:05,038 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-14 21:11:05,038 INFO L272 TraceCheckUtils]: 12: Hoare triple {557#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:05,038 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-14 21:11:05,039 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) 50) 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-14 21:11:05,039 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-14 21:11:05,039 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-14 21:11:05,039 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-14 21:11:05,039 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) 50) 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-14 21:11:05,039 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-14 21:11:05,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {557#true} is VALID [2022-04-14 21:11:05,040 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-14 21:11:05,040 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-14 21:11:05,040 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-14 21:11:05,040 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-14 21:11:05,040 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-14 21:11:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:11:05,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072449269] [2022-04-14 21:11:05,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:11:05,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391648991] [2022-04-14 21:11:05,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391648991] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 21:11:05,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 21:11:05,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-14 21:11:05,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212699395] [2022-04-14 21:11:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:11:05,042 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-14 21:11:05,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:11:05,043 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-14 21:11:07,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 21:11:07,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:11:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:11:07,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:11:07,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-14 21:11:07,100 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-14 21:11:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:08,141 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-14 21:11:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 21:11:08,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (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-14 21:11:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:11:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (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-14 21:11:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 21:11:08,145 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-14 21:11:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-14 21:11:08,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-14 21:11:09,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:11:09,141 INFO L225 Difference]: With dead ends: 44 [2022-04-14 21:11:09,141 INFO L226 Difference]: Without dead ends: 44 [2022-04-14 21:11:09,142 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-14 21:11:09,143 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-14 21:11:09,143 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-14 21:11:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-14 21:11:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-14 21:11:09,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:11:09,147 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-14 21:11:09,147 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-14 21:11:09,148 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-14 21:11:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:09,150 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-14 21:11:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-14 21:11:09,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:09,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:09,152 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-14 21:11:09,152 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-14 21:11:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:09,155 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-14 21:11:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-14 21:11:09,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:09,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:09,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:11:09,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:11:09,156 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-14 21:11:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-14 21:11:09,158 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-14 21:11:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:11:09,159 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-14 21:11:09,159 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-14 21:11:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-14 21:11:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 21:11:09,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:11:09,160 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-14 21:11:09,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 21:11:09,371 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-14 21:11:09,372 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:11:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:11:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1858557484, now seen corresponding path program 1 times [2022-04-14 21:11:09,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:11:09,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40675414] [2022-04-14 21:11:09,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:11:09,389 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:11:09,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316017282] [2022-04-14 21:11:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:11:09,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:11:09,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:11:09,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 21:11:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:11:09,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-14 21:11:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:11:09,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:11:09,546 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-14 21:11:09,546 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-14 21:11:09,547 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-14 21:11:09,547 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-14 21:11:09,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {968#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {968#true} is VALID [2022-04-14 21:11:09,547 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-14 21:11:09,547 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) 50) 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-14 21:11:09,547 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-14 21:11:09,547 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-14 21:11:09,548 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-14 21:11:09,548 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) 50) 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-14 21:11:09,548 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-14 21:11:09,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {968#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:09,548 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-14 21:11:09,548 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-14 21:11:09,548 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-14 21:11:09,549 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:09,549 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-14 21:11:09,549 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-14 21:11:09,549 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-14 21:11:09,549 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-14 21:11:09,549 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-14 21:11:09,549 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-14 21:11:09,549 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-14 21:11:09,550 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-14 21:11:09,550 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-14 21:11:09,550 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-14 21:11:09,551 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-14 21:11:09,551 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-14 21:11:09,551 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-14 21:11:09,552 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-14 21:11:09,552 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-14 21:11:09,552 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-14 21:11:09,552 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-14 21:11:09,553 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-14 21:11:09,553 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-14 21:11:09,554 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-14 21:11:09,554 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-14 21:11:09,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {969#false} is VALID [2022-04-14 21:11:09,554 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-14 21:11:09,554 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-14 21:11:09,554 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-14 21:11:09,555 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-14 21:11:09,555 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-14 21:11:09,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:11:09,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:11:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40675414] [2022-04-14 21:11:09,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:11:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316017282] [2022-04-14 21:11:09,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316017282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:11:09,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:11:09,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 21:11:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193466291] [2022-04-14 21:11:09,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:11:09,557 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-14 21:11:09,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:11:09,557 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-14 21:11:09,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:11:09,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 21:11:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:11:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 21:11:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:11:09,585 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-14 21:11:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:09,651 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-14 21:11:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 21:11:09,652 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-14 21:11:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:11:09,652 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-14 21:11:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-14 21:11:09,654 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-14 21:11:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-14 21:11:09,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-14 21:11:09,691 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-14 21:11:09,692 INFO L225 Difference]: With dead ends: 44 [2022-04-14 21:11:09,692 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 21:11:09,692 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-14 21:11:09,693 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-14 21:11:09,694 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-14 21:11:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 21:11:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-14 21:11:09,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:11:09,697 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-14 21:11:09,698 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-14 21:11:09,698 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-14 21:11:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:09,700 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 21:11:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 21:11:09,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:09,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:09,701 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-14 21:11:09,701 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-14 21:11:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:09,703 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-14 21:11:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 21:11:09,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:09,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:09,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:11:09,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:11:09,704 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-14 21:11:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-14 21:11:09,706 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-14 21:11:09,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:11:09,706 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-14 21:11:09,707 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-14 21:11:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-14 21:11:09,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 21:11:09,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:11:09,708 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-14 21:11:09,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 21:11:09,931 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-14 21:11:09,932 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:11:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:11:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1983451131, now seen corresponding path program 1 times [2022-04-14 21:11:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:11:09,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837298428] [2022-04-14 21:11:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:11:09,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:11:09,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778468566] [2022-04-14 21:11:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:09,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:11:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:11:09,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:11:09,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 21:11:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:11:09,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 21:11:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:11:10,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:11:10,243 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-14 21:11:10,243 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-14 21:11:10,244 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-14 21:11:10,244 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-14 21:11:10,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:10,244 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-14 21:11:10,244 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) 50) 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-14 21:11:10,244 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-14 21:11:10,245 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-14 21:11:10,245 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-14 21:11:10,245 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) 50) 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-14 21:11:10,245 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-14 21:11:10,245 INFO L272 TraceCheckUtils]: 12: Hoare triple {1254#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:10,245 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-14 21:11:10,245 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-14 21:11:10,245 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-14 21:11:10,246 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:10,246 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-14 21:11:10,246 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-14 21:11:10,246 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-14 21:11:10,246 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-14 21:11:10,246 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-14 21:11:10,247 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-14 21:11:10,247 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-14 21:11:10,247 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-14 21:11:10,247 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-14 21:11:10,247 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-14 21:11:10,247 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-14 21:11:10,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:10,248 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-14 21:11:10,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:10,248 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-14 21:11:10,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {1254#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:10,248 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-14 21:11:10,249 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-14 21:11:10,249 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-14 21:11:10,250 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-14 21:11:10,251 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-14 21:11:10,251 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-14 21:11:10,252 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-14 21:11:10,252 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-14 21:11:10,253 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-14 21:11:10,253 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-14 21:11:10,253 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-14 21:11:10,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:11:11,821 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-14 21:11:11,822 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-14 21:11:11,822 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-14 21:11:11,823 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-14 21:11:11,823 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-14 21:11:11,824 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-14 21:11:11,825 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-14 21:11:11,825 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-14 21:11:11,825 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-14 21:11:11,826 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-14 21:11:11,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {1254#true} [118] L46-2-->L42: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:11,826 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-14 21:11:11,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:11,826 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-14 21:11:11,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {1254#true} [115] L37-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:11,827 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-14 21:11:11,827 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-14 21:11:11,827 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-14 21:11:11,827 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-14 21:11:11,827 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-14 21:11:11,827 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-14 21:11:11,827 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-14 21:11:11,828 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-14 21:11:11,828 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-14 21:11:11,828 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-14 21:11:11,828 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-14 21:11:11,828 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: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:11,828 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-14 21:11:11,828 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-14 21:11:11,829 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-14 21:11:11,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {1254#true} [106] L31-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~B~0_9 4294967296) 50) 1 0)) 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-14 21:11:11,829 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-14 21:11:11,829 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) 50) 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-14 21:11:11,829 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-14 21:11:11,829 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-14 21:11:11,829 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-14 21:11:11,830 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) 50) 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-14 21:11:11,830 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-14 21:11:11,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {1254#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1254#true} is VALID [2022-04-14 21:11:11,830 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-14 21:11:11,830 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-14 21:11:11,830 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-14 21:11:11,830 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-14 21:11:11,831 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-14 21:11:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:11:11,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837298428] [2022-04-14 21:11:11,831 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:11:11,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778468566] [2022-04-14 21:11:11,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778468566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:11:11,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:11:11,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-14 21:11:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342501165] [2022-04-14 21:11:11,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:11:11,832 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-14 21:11:11,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:11:11,833 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-14 21:11:11,865 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-14 21:11:11,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 21:11:11,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:11:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 21:11:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 21:11:11,866 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-14 21:11:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:13,503 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-04-14 21:11:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 21:11:13,503 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-14 21:11:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:11:13,504 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-14 21:11:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-14 21:11:13,505 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-14 21:11:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-04-14 21:11:13,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2022-04-14 21:11:13,542 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-14 21:11:13,543 INFO L225 Difference]: With dead ends: 41 [2022-04-14 21:11:13,543 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 21:11:13,544 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-14 21:11:13,544 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-14 21:11:13,545 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.6s Time] [2022-04-14 21:11:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 21:11:13,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 21:11:13,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:11:13,551 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-14 21:11:13,551 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-14 21:11:13,551 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-14 21:11:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:13,554 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 21:11:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 21:11:13,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:13,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:13,555 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-14 21:11:13,555 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-14 21:11:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:11:13,557 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-14 21:11:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 21:11:13,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:11:13,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:11:13,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:11:13,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:11:13,558 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-14 21:11:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-14 21:11:13,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-14 21:11:13,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:11:13,563 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-14 21:11:13,563 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-14 21:11:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-14 21:11:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 21:11:13,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:11:13,568 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-14 21:11:13,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 21:11:13,771 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-14 21:11:13,772 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:11:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:11:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash 270500047, now seen corresponding path program 1 times [2022-04-14 21:11:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:11:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903288849] [2022-04-14 21:11:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:11:13,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:11:13,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827961665] [2022-04-14 21:11:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:11:13,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:11:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:11:13,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:11:13,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process