/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:56:54,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:56:54,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:56:54,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:56:54,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:56:54,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:56:54,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:56:54,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:56:54,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:56:54,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:56:54,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:56:54,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:56:54,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:56:54,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:56:54,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:56:54,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:56:54,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:56:54,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:56:54,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:56:54,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:56:54,473 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:56:54,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:56:54,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:56:54,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:56:54,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:56:54,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:56:54,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:56:54,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:56:54,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:56:54,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:56:54,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:56:54,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:56:54,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:56:54,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:56:54,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:56:54,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:56:54,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:56:54,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:56:54,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:56:54,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:56:54,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:56:54,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:56:54,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:56:54,506 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:56:54,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:56:54,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:56:54,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:56:54,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:56:54,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:56:54,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:56:54,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:56:54,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:56:54,509 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:56:54,509 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:56:54,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:56:54,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:56:54,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:56:54,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:56:54,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:56:54,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:56:54,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:56:54,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:56:54,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:56:54,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:56:54,511 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:56:54,511 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:56:54,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:56:54,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:56:54,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:56:54,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:56:54,776 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:56:54,777 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c [2022-04-14 21:56:54,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ae1ba0f/a8ccc44715a649cf84378b1ea5b89aab/FLAG5ddf60574 [2022-04-14 21:56:55,221 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:56:55,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c [2022-04-14 21:56:55,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ae1ba0f/a8ccc44715a649cf84378b1ea5b89aab/FLAG5ddf60574 [2022-04-14 21:56:55,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ae1ba0f/a8ccc44715a649cf84378b1ea5b89aab [2022-04-14 21:56:55,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:56:55,639 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:56:55,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:56:55,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:56:55,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:56:55,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193ff2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55, skipping insertion in model container [2022-04-14 21:56:55,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:56:55,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:56:55,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c[537,550] [2022-04-14 21:56:55,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:56:55,889 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:56:55,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound20.c[537,550] [2022-04-14 21:56:55,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:56:55,937 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:56:55,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55 WrapperNode [2022-04-14 21:56:55,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:56:55,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:56:55,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:56:55,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:56:55,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:56:55,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:56:55,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:56:55,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:56:55,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (1/1) ... [2022-04-14 21:56:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:56:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:56:56,020 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:56:56,043 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:56:56,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:56:56,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:56:56,058 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:56:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:56:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:56:56,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:56:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:56:56,059 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:56:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:56:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:56:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 21:56:56,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:56:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:56:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:56:56,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:56:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:56:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:56:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:56:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:56:56,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:56:56,116 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:56:56,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:56:56,240 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:56:56,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:56:56,246 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 21:56:56,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:56:56 BoogieIcfgContainer [2022-04-14 21:56:56,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:56:56,248 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:56:56,248 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:56:56,249 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:56:56,252 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:56:56" (1/1) ... [2022-04-14 21:56:56,253 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:56:56,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:56:56 BasicIcfg [2022-04-14 21:56:56,276 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:56:56,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:56:56,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:56:56,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:56:56,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:56:55" (1/4) ... [2022-04-14 21:56:56,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc5418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:56:56, skipping insertion in model container [2022-04-14 21:56:56,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:56:55" (2/4) ... [2022-04-14 21:56:56,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc5418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:56:56, skipping insertion in model container [2022-04-14 21:56:56,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:56:56" (3/4) ... [2022-04-14 21:56:56,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efc5418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:56:56, skipping insertion in model container [2022-04-14 21:56:56,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:56:56" (4/4) ... [2022-04-14 21:56:56,283 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.cJordan [2022-04-14 21:56:56,286 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:56:56,287 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:56:56,319 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:56:56,324 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:56:56,325 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:56:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:56:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 21:56:56,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:56:56,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:56:56,344 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:56:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:56:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 79654685, now seen corresponding path program 1 times [2022-04-14 21:56:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:56:56,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956693355] [2022-04-14 21:56:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:56:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:56:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:56,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {40#true} is VALID [2022-04-14 21:56:56,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:56:56,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:56:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:56:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:56,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-14 21:56:56,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-14 21:56:56,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:56:56,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {40#true} is VALID [2022-04-14 21:56:56,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:56:56,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:56:56,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:56:56,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {40#true} is VALID [2022-04-14 21:56:56,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-14 21:56:56,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-14 21:56:56,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,628 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-14 21:56:56,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {41#false} is VALID [2022-04-14 21:56:56,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} [108] L35-3-->L53-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,629 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} [112] L53-2-->L45-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,631 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {41#false} is VALID [2022-04-14 21:56:56,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-14 21:56:56,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:56:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:56:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:56:56,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956693355] [2022-04-14 21:56:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956693355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:56:56,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:56:56,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 21:56:56,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274387632] [2022-04-14 21:56:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:56:56,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:56:56,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:56:56,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:56,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:56,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 21:56:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:56:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 21:56:56,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:56:56,701 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:56,883 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 21:56:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 21:56:56,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:56:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:56:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-14 21:56:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-14 21:56:56,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-14 21:56:56,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:56,957 INFO L225 Difference]: With dead ends: 38 [2022-04-14 21:56:56,957 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 21:56:56,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:56:56,961 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:56:56,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 21:56:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 21:56:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-14 21:56:56,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:56:56,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:56,986 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:56,987 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:56,991 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-14 21:56:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-14 21:56:56,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:56,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:56,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-14 21:56:56,993 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-14 21:56:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:56,996 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-14 21:56:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-14 21:56:56,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:56,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:56,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:56:56,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:56:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 21:56:57,001 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-14 21:56:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:56:57,002 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 21:56:57,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 21:56:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 21:56:57,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:56:57,003 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:56:57,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 21:56:57,003 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:56:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:56:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash -85369733, now seen corresponding path program 1 times [2022-04-14 21:56:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:56:57,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796330431] [2022-04-14 21:56:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:56:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:56:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:57,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {188#true} is VALID [2022-04-14 21:56:57,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#true} {188#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:56:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:57,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {188#true} is VALID [2022-04-14 21:56:57,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-14 21:56:57,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {188#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:56:57,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {188#true} is VALID [2022-04-14 21:56:57,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {188#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {188#true} is VALID [2022-04-14 21:56:57,104 INFO L272 TraceCheckUtils]: 6: Hoare triple {188#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-14 21:56:57,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {188#true} is VALID [2022-04-14 21:56:57,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:56:57,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {188#true} {188#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-14 21:56:57,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {197#(= main_~q~0 0)} is VALID [2022-04-14 21:56:57,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {197#(= main_~q~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {197#(= main_~q~0 0)} is VALID [2022-04-14 21:56:57,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#(= main_~q~0 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {197#(= main_~q~0 0)} is VALID [2022-04-14 21:56:57,107 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#(= main_~q~0 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:56:57,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 21:56:57,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {199#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {189#false} is VALID [2022-04-14 21:56:57,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {189#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#false} is VALID [2022-04-14 21:56:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:56:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:56:57,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796330431] [2022-04-14 21:56:57,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796330431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:56:57,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:56:57,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 21:56:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021304912] [2022-04-14 21:56:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:56:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:56:57,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:56:57,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:57,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:57,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:56:57,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:56:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:56:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:56:57,128 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:57,526 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 21:56:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 21:56:57,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:56:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:56:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:56:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:56:57,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-14 21:56:57,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:57,604 INFO L225 Difference]: With dead ends: 45 [2022-04-14 21:56:57,604 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 21:56:57,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 21:56:57,605 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 21:56:57,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 21:56:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 21:56:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-14 21:56:57,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:56:57,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:57,611 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:57,611 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:57,614 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 21:56:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-14 21:56:57,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:57,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:57,616 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-14 21:56:57,616 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-14 21:56:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:57,619 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 21:56:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-14 21:56:57,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:57,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:57,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:56:57,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:56:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-14 21:56:57,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-14 21:56:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:56:57,622 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-14 21:56:57,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:56:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-14 21:56:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 21:56:57,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:56:57,623 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:56:57,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 21:56:57,624 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:56:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:56:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1527809342, now seen corresponding path program 1 times [2022-04-14 21:56:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:56:57,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380060490] [2022-04-14 21:56:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:56:57,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:56:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336760916] [2022-04-14 21:56:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:57,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:56:57,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:56:57,647 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:56:57,667 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:56:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:57,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 21:56:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:57,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:56:57,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {382#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#true} is VALID [2022-04-14 21:56:57,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#(<= ~counter~0 0)} {382#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {390#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(<= ~counter~0 0)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {390#(<= ~counter~0 0)} {390#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:56:57,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {390#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {424#(<= |main_#t~post6| 0)} is VALID [2022-04-14 21:56:57,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(<= |main_#t~post6| 0)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {383#false} is VALID [2022-04-14 21:56:57,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {383#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {383#false} is VALID [2022-04-14 21:56:57,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {383#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 20)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {383#false} is VALID [2022-04-14 21:56:57,927 INFO L272 TraceCheckUtils]: 16: Hoare triple {383#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {383#false} is VALID [2022-04-14 21:56:57,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {383#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {383#false} is VALID [2022-04-14 21:56:57,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {383#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {383#false} is VALID [2022-04-14 21:56:57,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {383#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#false} is VALID [2022-04-14 21:56:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:56:57,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:56:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:56:57,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380060490] [2022-04-14 21:56:57,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:56:57,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336760916] [2022-04-14 21:56:57,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336760916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:56:57,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:56:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 21:56:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513701558] [2022-04-14 21:56:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:56:57,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 21:56:57,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:56:57,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:56:57,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:57,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 21:56:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:56:57,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 21:56:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:56:57,950 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:56:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:58,035 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 21:56:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 21:56:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 21:56:58,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:56:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:56:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-14 21:56:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:56:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-14 21:56:58,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-14 21:56:58,084 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:56:58,087 INFO L225 Difference]: With dead ends: 38 [2022-04-14 21:56:58,087 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 21:56:58,087 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:56:58,090 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:56:58,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:56:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 21:56:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 21:56:58,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:56:58,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,102 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,102 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:58,108 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 21:56:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 21:56:58,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:58,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:58,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-14 21:56:58,111 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-14 21:56:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:58,115 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 21:56:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 21:56:58,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:58,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:58,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:56:58,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:56:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-14 21:56:58,124 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-14 21:56:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:56:58,125 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-14 21:56:58,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:56:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 21:56:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 21:56:58,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:56:58,126 INFO L499 BasicCegarLoop]: trace histogram [2, 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:56:58,153 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:56:58,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:56:58,350 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:56:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:56:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2128444854, now seen corresponding path program 1 times [2022-04-14 21:56:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:56:58,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559873208] [2022-04-14 21:56:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:56:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:58,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:56:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:58,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {597#true} is VALID [2022-04-14 21:56:58,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:56:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:58,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {597#true} is VALID [2022-04-14 21:56:58,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-14 21:56:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-14 21:56:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:58,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#true} is VALID [2022-04-14 21:56:58,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-14 21:56:58,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:56:58,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {597#true} is VALID [2022-04-14 21:56:58,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {597#true} is VALID [2022-04-14 21:56:58,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {597#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-14 21:56:58,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {597#true} is VALID [2022-04-14 21:56:58,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#true} {597#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-14 21:56:58,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-14 21:56:58,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-14 21:56:58,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-14 21:56:58,462 INFO L272 TraceCheckUtils]: 14: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {597#true} is VALID [2022-04-14 21:56:58,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#true} is VALID [2022-04-14 21:56:58,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {597#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {597#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:56:58,464 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {597#true} {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-14 21:56:58,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {606#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:56:58,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 21:56:58,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {612#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-14 21:56:58,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {598#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-14 21:56:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:56:58,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:56:58,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559873208] [2022-04-14 21:56:58,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559873208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:56:58,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:56:58,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 21:56:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758902696] [2022-04-14 21:56:58,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:56:58,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 21:56:58,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:56:58,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:56:58,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:58,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:56:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:56:58,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:56:58,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:56:58,485 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:56:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:58,872 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 21:56:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 21:56:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 21:56:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:56:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:56:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:56:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:56:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:56:58,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-14 21:56:58,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:56:58,945 INFO L225 Difference]: With dead ends: 50 [2022-04-14 21:56:58,945 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 21:56:58,946 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 21:56:58,946 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:56:58,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 21:56:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 21:56:58,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-14 21:56:58,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:56:58,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,951 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,951 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:58,953 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 21:56:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-14 21:56:58,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:58,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:58,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-14 21:56:58,954 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-14 21:56:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:56:58,959 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 21:56:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-14 21:56:58,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:56:58,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:56:58,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:56:58,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:56:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:56:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-14 21:56:58,962 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-14 21:56:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:56:58,963 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-14 21:56:58,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:56:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-14 21:56:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 21:56:58,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:56:58,964 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 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:56:58,965 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 21:56:58,965 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:56:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:56:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash 135546551, now seen corresponding path program 1 times [2022-04-14 21:56:58,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:56:58,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231077271] [2022-04-14 21:56:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:56:58,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:56:58,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [219482732] [2022-04-14 21:56:58,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:56:58,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:56:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:56:59,004 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:56:59,029 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:56:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:59,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:56:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:56:59,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:56:59,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {816#true} is VALID [2022-04-14 21:56:59,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {816#true} is VALID [2022-04-14 21:56:59,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {816#true} is VALID [2022-04-14 21:56:59,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {816#true} is VALID [2022-04-14 21:56:59,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {816#true} {816#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {816#true} is VALID [2022-04-14 21:56:59,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:56:59,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:56:59,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:56:59,262 INFO L272 TraceCheckUtils]: 14: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {816#true} is VALID [2022-04-14 21:56:59,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {816#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {816#true} is VALID [2022-04-14 21:56:59,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,266 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {816#true} {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:56:59,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {816#true} is VALID [2022-04-14 21:56:59,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {816#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {816#true} is VALID [2022-04-14 21:56:59,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {816#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {816#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:56:59,279 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {816#true} {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:56:59,280 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:56:59,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:56:59,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {817#false} is VALID [2022-04-14 21:56:59,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {817#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {817#false} is VALID [2022-04-14 21:56:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 21:56:59,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:56:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:56:59,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231077271] [2022-04-14 21:56:59,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:56:59,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219482732] [2022-04-14 21:56:59,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219482732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:56:59,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:56:59,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:56:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46940562] [2022-04-14 21:56:59,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:56:59,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 21:56:59,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:56:59,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:56:59,307 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:56:59,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:56:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:56:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:56:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:56:59,308 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:57:01,478 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 21:57:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:01,657 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-14 21:57:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:57:01,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 21:57:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:57:01,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:57:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 21:57:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:57:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 21:57:01,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-14 21:57:01,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:01,743 INFO L225 Difference]: With dead ends: 57 [2022-04-14 21:57:01,743 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 21:57:01,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:57:01,744 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:57:01,745 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 21:57:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 21:57:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 21:57:01,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:57:01,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:01,750 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:01,750 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:01,752 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-14 21:57:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-14 21:57:01,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:01,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:01,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-14 21:57:01,753 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-14 21:57:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:01,756 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-14 21:57:01,756 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-14 21:57:01,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:01,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:01,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:57:01,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:57:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-14 21:57:01,759 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-14 21:57:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:57:01,760 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-14 21:57:01,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:57:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-14 21:57:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 21:57:01,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:57:01,761 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:57:01,785 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:57:01,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:01,961 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:57:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:57:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1016025214, now seen corresponding path program 1 times [2022-04-14 21:57:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:57:01,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811447687] [2022-04-14 21:57:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:57:01,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:57:01,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617102415] [2022-04-14 21:57:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:01,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:57:01,976 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:57:01,996 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:57:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:02,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:57:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:02,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:57:02,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:57:02,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {1139#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1139#(<= ~counter~0 0)} {1131#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {1139#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {1139#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {1139#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {1139#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1139#(<= ~counter~0 0)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1139#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,280 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1139#(<= ~counter~0 0)} {1139#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {1139#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1139#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:02,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {1139#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {1173#(<= ~counter~0 1)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {1173#(<= ~counter~0 1)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {1173#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,285 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1173#(<= ~counter~0 1)} {1173#(<= ~counter~0 1)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,285 INFO L272 TraceCheckUtils]: 19: Hoare triple {1173#(<= ~counter~0 1)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {1173#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {1173#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,287 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1173#(<= ~counter~0 1)} {1173#(<= ~counter~0 1)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,287 INFO L272 TraceCheckUtils]: 24: Hoare triple {1173#(<= ~counter~0 1)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {1173#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {1173#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1173#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,290 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1173#(<= ~counter~0 1)} {1173#(<= ~counter~0 1)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {1173#(<= ~counter~0 1)} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1173#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:02,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1173#(<= ~counter~0 1)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1228#(<= |main_#t~post7| 1)} is VALID [2022-04-14 21:57:02,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {1228#(<= |main_#t~post7| 1)} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 20)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1132#false} is VALID [2022-04-14 21:57:02,291 INFO L272 TraceCheckUtils]: 32: Hoare triple {1132#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1132#false} is VALID [2022-04-14 21:57:02,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {1132#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1132#false} is VALID [2022-04-14 21:57:02,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {1132#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1132#false} is VALID [2022-04-14 21:57:02,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {1132#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1132#false} is VALID [2022-04-14 21:57:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 21:57:02,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:57:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:57:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811447687] [2022-04-14 21:57:02,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:57:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617102415] [2022-04-14 21:57:02,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617102415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:57:02,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:57:02,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:57:02,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381274928] [2022-04-14 21:57:02,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:57:02,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-14 21:57:02,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:57:02,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 21:57:02,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:02,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:57:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:57:02,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:57:02,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:57:02,320 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 21:57:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:02,487 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-14 21:57:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:57:02,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-14 21:57:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:57:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 21:57:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-14 21:57:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 21:57:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-14 21:57:02,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-14 21:57:02,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:02,547 INFO L225 Difference]: With dead ends: 69 [2022-04-14 21:57:02,547 INFO L226 Difference]: Without dead ends: 69 [2022-04-14 21:57:02,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:57:02,549 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:57:02,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:57:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-14 21:57:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-14 21:57:02,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:57:02,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:02,562 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:02,563 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:02,565 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-14 21:57:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-14 21:57:02,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:02,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:02,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-14 21:57:02,566 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-14 21:57:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:02,576 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-14 21:57:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-14 21:57:02,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:02,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:02,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:57:02,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:57:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:57:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-14 21:57:02,578 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-14 21:57:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:57:02,580 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-14 21:57:02,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 21:57:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-14 21:57:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 21:57:02,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:57:02,582 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:57:02,610 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:57:02,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:02,802 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:57:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:57:02,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1017127481, now seen corresponding path program 1 times [2022-04-14 21:57:02,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:57:02,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818420271] [2022-04-14 21:57:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:02,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:57:02,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:57:02,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [594416990] [2022-04-14 21:57:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:02,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:57:02,823 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:57:02,824 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:57:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:02,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 21:57:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:02,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:57:03,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {1518#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {1518#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1518#true} is VALID [2022-04-14 21:57:03,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {1518#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1518#true} {1518#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {1518#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {1518#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1518#true} is VALID [2022-04-14 21:57:03,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {1518#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1518#true} is VALID [2022-04-14 21:57:03,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {1518#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1518#true} is VALID [2022-04-14 21:57:03,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {1518#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1518#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1518#true} {1518#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1518#true} is VALID [2022-04-14 21:57:03,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {1518#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-14 21:57:03,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-14 21:57:03,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-14 21:57:03,423 INFO L272 TraceCheckUtils]: 14: Hoare triple {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1518#true} is VALID [2022-04-14 21:57:03,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {1518#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1518#true} is VALID [2022-04-14 21:57:03,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {1518#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {1518#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,428 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1518#true} {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-14 21:57:03,428 INFO L272 TraceCheckUtils]: 19: Hoare triple {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1518#true} is VALID [2022-04-14 21:57:03,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {1518#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1518#true} is VALID [2022-04-14 21:57:03,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {1518#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {1518#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1518#true} {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-14 21:57:03,429 INFO L272 TraceCheckUtils]: 24: Hoare triple {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1518#true} is VALID [2022-04-14 21:57:03,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1518#true} is VALID [2022-04-14 21:57:03,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {1518#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {1518#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1518#true} is VALID [2022-04-14 21:57:03,430 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1518#true} {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-14 21:57:03,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {1556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1611#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-14 21:57:03,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1611#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1611#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-14 21:57:03,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {1611#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [119] L45-->L46: Formula: (< |v_main_#t~post7_5| 20) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1611#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-14 21:57:03,436 INFO L272 TraceCheckUtils]: 32: Hoare triple {1611#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [123] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {1621#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:57:03,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {1621#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:57:03,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1519#false} is VALID [2022-04-14 21:57:03,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {1519#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1519#false} is VALID [2022-04-14 21:57:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 21:57:03,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:57:03,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:57:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818420271] [2022-04-14 21:57:03,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:57:03,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594416990] [2022-04-14 21:57:03,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594416990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:57:03,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:57:03,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 21:57:03,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364163166] [2022-04-14 21:57:03,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:57:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 21:57:03,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:57:03,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:57:03,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:03,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:57:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:57:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:57:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:57:03,470 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:57:06,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 21:57:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:06,089 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-04-14 21:57:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 21:57:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 21:57:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:57:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:57:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-14 21:57:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:57:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-14 21:57:06,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-14 21:57:06,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:06,193 INFO L225 Difference]: With dead ends: 80 [2022-04-14 21:57:06,193 INFO L226 Difference]: Without dead ends: 79 [2022-04-14 21:57:06,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 21:57:06,194 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 21:57:06,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 21:57:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-14 21:57:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-14 21:57:06,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:57:06,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 21:57:06,199 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 21:57:06,199 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 21:57:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:06,202 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-14 21:57:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-14 21:57:06,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:06,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:06,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-14 21:57:06,204 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-14 21:57:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:06,207 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-14 21:57:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-14 21:57:06,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:06,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:06,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:57:06,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:57:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 21:57:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-14 21:57:06,210 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-14 21:57:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:57:06,211 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-14 21:57:06,211 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:57:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-14 21:57:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 21:57:06,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:57:06,211 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:57:06,241 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:57:06,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:06,427 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:57:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:57:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1880362404, now seen corresponding path program 1 times [2022-04-14 21:57:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:57:06,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672062925] [2022-04-14 21:57:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:57:06,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:57:06,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834794514] [2022-04-14 21:57:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:57:06,456 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:57:06,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 21:57:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:06,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:57:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:06,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:57:06,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {1951#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {1951#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1959#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1959#(<= ~counter~0 0)} {1951#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1959#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {1959#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {1959#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {1959#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {1959#(<= ~counter~0 0)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1959#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1959#(<= ~counter~0 0)} {1959#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {1959#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1959#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:06,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {1959#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {1993#(<= ~counter~0 1)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,748 INFO L272 TraceCheckUtils]: 14: Hoare triple {1993#(<= ~counter~0 1)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {1993#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {1993#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {1993#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,749 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,751 INFO L272 TraceCheckUtils]: 19: Hoare triple {1993#(<= ~counter~0 1)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1993#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {1993#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {1993#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,753 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,754 INFO L272 TraceCheckUtils]: 24: Hoare triple {1993#(<= ~counter~0 1)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {1993#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {1993#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {1993#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,757 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1993#(<= ~counter~0 1)} {1993#(<= ~counter~0 1)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {1993#(<= ~counter~0 1)} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1993#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:06,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {1993#(<= ~counter~0 1)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2048#(<= |main_#t~post6| 1)} is VALID [2022-04-14 21:57:06,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {2048#(<= |main_#t~post6| 1)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1952#false} is VALID [2022-04-14 21:57:06,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {1952#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1952#false} is VALID [2022-04-14 21:57:06,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {1952#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 20)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1952#false} is VALID [2022-04-14 21:57:06,759 INFO L272 TraceCheckUtils]: 34: Hoare triple {1952#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1952#false} is VALID [2022-04-14 21:57:06,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {1952#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1952#false} is VALID [2022-04-14 21:57:06,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {1952#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1952#false} is VALID [2022-04-14 21:57:06,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {1952#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1952#false} is VALID [2022-04-14 21:57:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 21:57:06,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:57:06,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {1952#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1952#false} is VALID [2022-04-14 21:57:06,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {1952#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1952#false} is VALID [2022-04-14 21:57:06,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {1952#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1952#false} is VALID [2022-04-14 21:57:06,980 INFO L272 TraceCheckUtils]: 34: Hoare triple {1952#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1952#false} is VALID [2022-04-14 21:57:06,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {1952#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 20)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1952#false} is VALID [2022-04-14 21:57:06,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {1952#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1952#false} is VALID [2022-04-14 21:57:06,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {2088#(< |main_#t~post6| 20)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 20)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1952#false} is VALID [2022-04-14 21:57:06,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {2092#(< ~counter~0 20)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2088#(< |main_#t~post6| 20)} is VALID [2022-04-14 21:57:06,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {2092#(< ~counter~0 20)} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2092#(< ~counter~0 20)} is VALID [2022-04-14 21:57:06,984 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1951#true} {2092#(< ~counter~0 20)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2092#(< ~counter~0 20)} is VALID [2022-04-14 21:57:06,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {1951#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {1951#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {1951#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1951#true} is VALID [2022-04-14 21:57:06,984 INFO L272 TraceCheckUtils]: 24: Hoare triple {2092#(< ~counter~0 20)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1951#true} is VALID [2022-04-14 21:57:06,985 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1951#true} {2092#(< ~counter~0 20)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2092#(< ~counter~0 20)} is VALID [2022-04-14 21:57:06,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {1951#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {1951#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {1951#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1951#true} is VALID [2022-04-14 21:57:06,985 INFO L272 TraceCheckUtils]: 19: Hoare triple {2092#(< ~counter~0 20)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1951#true} is VALID [2022-04-14 21:57:06,986 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1951#true} {2092#(< ~counter~0 20)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2092#(< ~counter~0 20)} is VALID [2022-04-14 21:57:06,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {1951#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {1951#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {1951#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1951#true} is VALID [2022-04-14 21:57:06,986 INFO L272 TraceCheckUtils]: 14: Hoare triple {2092#(< ~counter~0 20)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1951#true} is VALID [2022-04-14 21:57:06,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {2092#(< ~counter~0 20)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2092#(< ~counter~0 20)} is VALID [2022-04-14 21:57:06,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {2147#(< ~counter~0 19)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2092#(< ~counter~0 20)} is VALID [2022-04-14 21:57:06,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {2147#(< ~counter~0 19)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,988 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1951#true} {2147#(< ~counter~0 19)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1951#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1951#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {1951#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1951#true} is VALID [2022-04-14 21:57:06,989 INFO L272 TraceCheckUtils]: 6: Hoare triple {2147#(< ~counter~0 19)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1951#true} is VALID [2022-04-14 21:57:06,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {2147#(< ~counter~0 19)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {2147#(< ~counter~0 19)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2147#(< ~counter~0 19)} {1951#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {2147#(< ~counter~0 19)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {1951#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2147#(< ~counter~0 19)} is VALID [2022-04-14 21:57:06,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {1951#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1951#true} is VALID [2022-04-14 21:57:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 21:57:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:57:06,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672062925] [2022-04-14 21:57:06,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:57:06,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834794514] [2022-04-14 21:57:06,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834794514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:57:06,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:57:06,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 21:57:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89516104] [2022-04-14 21:57:06,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:57:06,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-14 21:57:06,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:57:06,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 21:57:07,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:07,038 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 21:57:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:57:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 21:57:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 21:57:07,040 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 21:57:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:07,485 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-14 21:57:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 21:57:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-14 21:57:07,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:57:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 21:57:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-04-14 21:57:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 21:57:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2022-04-14 21:57:07,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 114 transitions. [2022-04-14 21:57:07,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:07,615 INFO L225 Difference]: With dead ends: 146 [2022-04-14 21:57:07,615 INFO L226 Difference]: Without dead ends: 146 [2022-04-14 21:57:07,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 21:57:07,616 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:57:07,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 180 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 21:57:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-14 21:57:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-04-14 21:57:07,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:57:07,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 21:57:07,633 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 21:57:07,634 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 21:57:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:07,642 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-14 21:57:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-14 21:57:07,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:07,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:07,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-14 21:57:07,644 INFO L87 Difference]: Start difference. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-14 21:57:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:07,648 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-14 21:57:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-14 21:57:07,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:07,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:07,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:57:07,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:57:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-14 21:57:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-04-14 21:57:07,653 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 38 [2022-04-14 21:57:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:57:07,653 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-04-14 21:57:07,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-14 21:57:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-14 21:57:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-14 21:57:07,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:57:07,654 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:57:07,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 21:57:07,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:07,875 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:57:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:57:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1525733273, now seen corresponding path program 1 times [2022-04-14 21:57:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:57:07,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474731032] [2022-04-14 21:57:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:57:07,890 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:57:07,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221594715] [2022-04-14 21:57:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:07,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:07,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:57:07,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:57:07,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 21:57:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:08,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-14 21:57:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:08,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:57:09,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2768#true} is VALID [2022-04-14 21:57:09,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2768#true} is VALID [2022-04-14 21:57:09,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {2768#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2768#true} is VALID [2022-04-14 21:57:09,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {2768#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2794#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 21:57:09,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {2794#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2798#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 21:57:09,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {2798#(not (= |assume_abort_if_not_#in~cond| 0))} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2798#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 21:57:09,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2798#(not (= |assume_abort_if_not_#in~cond| 0))} {2768#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2805#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-14 21:57:09,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {2805#(<= 1 (mod main_~B~0 4294967296))} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:57:09,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:57:09,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:57:09,007 INFO L272 TraceCheckUtils]: 14: Hoare triple {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2768#true} is VALID [2022-04-14 21:57:09,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,008 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2768#true} {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:57:09,008 INFO L272 TraceCheckUtils]: 19: Hoare triple {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2768#true} is VALID [2022-04-14 21:57:09,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,009 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2768#true} {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:57:09,009 INFO L272 TraceCheckUtils]: 24: Hoare triple {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2768#true} is VALID [2022-04-14 21:57:09,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,010 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2768#true} {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-14 21:57:09,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {2809#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-14 21:57:09,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-14 21:57:09,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-14 21:57:09,011 INFO L272 TraceCheckUtils]: 32: Hoare triple {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2768#true} is VALID [2022-04-14 21:57:09,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,012 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2768#true} {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-14 21:57:09,012 INFO L272 TraceCheckUtils]: 37: Hoare triple {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2768#true} is VALID [2022-04-14 21:57:09,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,013 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2768#true} {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-14 21:57:09,016 INFO L272 TraceCheckUtils]: 42: Hoare triple {2864#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:57:09,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {2904#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:57:09,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {2908#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2769#false} is VALID [2022-04-14 21:57:09,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {2769#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2769#false} is VALID [2022-04-14 21:57:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-14 21:57:09,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:57:09,468 INFO L290 TraceCheckUtils]: 45: Hoare triple {2769#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2769#false} is VALID [2022-04-14 21:57:09,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {2908#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2769#false} is VALID [2022-04-14 21:57:09,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {2904#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:57:09,472 INFO L272 TraceCheckUtils]: 42: Hoare triple {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:57:09,472 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2768#true} {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-14 21:57:09,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,473 INFO L272 TraceCheckUtils]: 37: Hoare triple {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2768#true} is VALID [2022-04-14 21:57:09,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2768#true} {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-14 21:57:09,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:09,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:09,480 INFO L272 TraceCheckUtils]: 32: Hoare triple {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2768#true} is VALID [2022-04-14 21:57:09,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-14 21:57:09,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-14 21:57:11,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [137] L38-->L35-3: Formula: (and (<= (mod v_main_~d~0_6 4294967296) (mod v_main_~r~0_5 4294967296)) (= v_main_~d~0_5 (* v_main_~d~0_6 2)) (= v_main_~p~0_4 (* v_main_~p~0_5 2))) InVars {main_~d~0=v_main_~d~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5} OutVars{main_~d~0=v_main_~d~0_5, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {2924#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-14 21:57:11,181 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2768#true} {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-14 21:57:11,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:11,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {2768#true} is VALID [2022-04-14 21:57:11,182 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2768#true} {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-14 21:57:11,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:11,182 INFO L272 TraceCheckUtils]: 19: Hoare triple {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {2768#true} is VALID [2022-04-14 21:57:11,183 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2768#true} {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-14 21:57:11,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {2768#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {2768#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {2768#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2768#true} is VALID [2022-04-14 21:57:11,183 INFO L272 TraceCheckUtils]: 14: Hoare triple {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {2768#true} is VALID [2022-04-14 21:57:11,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-14 21:57:11,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-14 21:57:11,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {2768#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {2964#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-14 21:57:11,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2768#true} {2768#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {2768#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {2768#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {2768#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {2768#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {2768#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2768#true} {2768#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2768#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2768#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2768#true} is VALID [2022-04-14 21:57:11,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2768#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2768#true} is VALID [2022-04-14 21:57:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-14 21:57:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:57:11,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474731032] [2022-04-14 21:57:11,186 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:57:11,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221594715] [2022-04-14 21:57:11,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221594715] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 21:57:11,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 21:57:11,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-14 21:57:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295862393] [2022-04-14 21:57:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:57:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-14 21:57:11,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:57:11,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 21:57:13,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:13,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:57:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:57:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:57:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-14 21:57:13,226 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 21:57:16,083 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:57:19,094 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:57:21,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 21:57:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:22,411 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-14 21:57:22,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:57:22,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-14 21:57:22,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:57:22,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 21:57:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-14 21:57:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 21:57:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-14 21:57:22,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-14 21:57:24,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:24,480 INFO L225 Difference]: With dead ends: 160 [2022-04-14 21:57:24,480 INFO L226 Difference]: Without dead ends: 160 [2022-04-14 21:57:24,480 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 21:57:24,481 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-14 21:57:24,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2022-04-14 21:57:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-14 21:57:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-04-14 21:57:24,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:57:24,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 21:57:24,489 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 21:57:24,490 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 21:57:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:24,495 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-14 21:57:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-14 21:57:24,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:24,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:24,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-14 21:57:24,497 INFO L87 Difference]: Start difference. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-14 21:57:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:24,502 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-14 21:57:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-14 21:57:24,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:24,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:24,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:57:24,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:57:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 21:57:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2022-04-14 21:57:24,507 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 46 [2022-04-14 21:57:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:57:24,508 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2022-04-14 21:57:24,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 21:57:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2022-04-14 21:57:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 21:57:24,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:57:24,509 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:57:24,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 21:57:24,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:24,713 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:57:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:57:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 450187565, now seen corresponding path program 1 times [2022-04-14 21:57:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:57:24,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203071275] [2022-04-14 21:57:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:57:24,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:57:24,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764244173] [2022-04-14 21:57:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:24,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:57:24,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:57:24,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 21:57:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:24,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 21:57:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:57:24,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:57:25,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {3690#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {3690#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {3698#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3698#(<= ~counter~0 0)} {3690#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {3698#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {3698#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {3698#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {3698#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {3698#(<= ~counter~0 0)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {3698#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3698#(<= ~counter~0 0)} {3698#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {3698#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {3698#(<= ~counter~0 0)} is VALID [2022-04-14 21:57:25,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {3698#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {3732#(<= ~counter~0 1)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,076 INFO L272 TraceCheckUtils]: 14: Hoare triple {3732#(<= ~counter~0 1)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {3732#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {3732#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {3732#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,078 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3732#(<= ~counter~0 1)} {3732#(<= ~counter~0 1)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,078 INFO L272 TraceCheckUtils]: 19: Hoare triple {3732#(<= ~counter~0 1)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3732#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {3732#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {3732#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,080 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3732#(<= ~counter~0 1)} {3732#(<= ~counter~0 1)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,081 INFO L272 TraceCheckUtils]: 24: Hoare triple {3732#(<= ~counter~0 1)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {3732#(<= ~counter~0 1)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {3732#(<= ~counter~0 1)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {3732#(<= ~counter~0 1)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,082 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3732#(<= ~counter~0 1)} {3732#(<= ~counter~0 1)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {3732#(<= ~counter~0 1)} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {3732#(<= ~counter~0 1)} is VALID [2022-04-14 21:57:25,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {3732#(<= ~counter~0 1)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {3787#(<= ~counter~0 2)} [119] L45-->L46: Formula: (< |v_main_#t~post7_5| 20) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,084 INFO L272 TraceCheckUtils]: 32: Hoare triple {3787#(<= ~counter~0 2)} [123] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {3787#(<= ~counter~0 2)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {3787#(<= ~counter~0 2)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {3787#(<= ~counter~0 2)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,086 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3787#(<= ~counter~0 2)} {3787#(<= ~counter~0 2)} [146] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,087 INFO L272 TraceCheckUtils]: 37: Hoare triple {3787#(<= ~counter~0 2)} [128] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {3787#(<= ~counter~0 2)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {3787#(<= ~counter~0 2)} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {3787#(<= ~counter~0 2)} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,088 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3787#(<= ~counter~0 2)} {3787#(<= ~counter~0 2)} [147] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {3787#(<= ~counter~0 2)} [135] L47-->L53: Formula: (let ((.cse0 (mod v_main_~p~0_9 4294967296))) (and (= v_main_~p~0_8 (div .cse0 2)) (not (= .cse0 1)) (= v_main_~d~0_8 (div (mod v_main_~d~0_9 4294967296) 2)))) InVars {main_~p~0=v_main_~p~0_9, main_~d~0=v_main_~d~0_9} OutVars{main_~p~0=v_main_~p~0_8, main_~d~0=v_main_~d~0_8} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {3787#(<= ~counter~0 2)} [138] L53-->L53-2: Formula: (and (= v_main_~q~0_5 (+ v_main_~p~0_10 v_main_~q~0_6)) (= v_main_~r~0_7 (+ v_main_~r~0_8 (* (- 1) v_main_~d~0_10))) (<= (mod v_main_~d~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_6, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3787#(<= ~counter~0 2)} is VALID [2022-04-14 21:57:25,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {3787#(<= ~counter~0 2)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3830#(<= |main_#t~post7| 2)} is VALID [2022-04-14 21:57:25,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {3830#(<= |main_#t~post7| 2)} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 20)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3691#false} is VALID [2022-04-14 21:57:25,090 INFO L272 TraceCheckUtils]: 46: Hoare triple {3691#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {3691#false} is VALID [2022-04-14 21:57:25,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {3691#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3691#false} is VALID [2022-04-14 21:57:25,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {3691#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3691#false} is VALID [2022-04-14 21:57:25,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {3691#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3691#false} is VALID [2022-04-14 21:57:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 21:57:25,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 21:57:25,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {3691#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3691#false} is VALID [2022-04-14 21:57:25,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {3691#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3691#false} is VALID [2022-04-14 21:57:25,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {3691#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3691#false} is VALID [2022-04-14 21:57:25,367 INFO L272 TraceCheckUtils]: 46: Hoare triple {3691#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {3691#false} is VALID [2022-04-14 21:57:25,367 INFO L290 TraceCheckUtils]: 45: Hoare triple {3858#(< |main_#t~post7| 20)} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 20)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3691#false} is VALID [2022-04-14 21:57:25,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {3862#(< ~counter~0 20)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3858#(< |main_#t~post7| 20)} is VALID [2022-04-14 21:57:25,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {3862#(< ~counter~0 20)} [138] L53-->L53-2: Formula: (and (= v_main_~q~0_5 (+ v_main_~p~0_10 v_main_~q~0_6)) (= v_main_~r~0_7 (+ v_main_~r~0_8 (* (- 1) v_main_~d~0_10))) (<= (mod v_main_~d~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_6, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~q~0=v_main_~q~0_5, main_~d~0=v_main_~d~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_7} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {3862#(< ~counter~0 20)} is VALID [2022-04-14 21:57:25,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {3862#(< ~counter~0 20)} [135] L47-->L53: Formula: (let ((.cse0 (mod v_main_~p~0_9 4294967296))) (and (= v_main_~p~0_8 (div .cse0 2)) (not (= .cse0 1)) (= v_main_~d~0_8 (div (mod v_main_~d~0_9 4294967296) 2)))) InVars {main_~p~0=v_main_~p~0_9, main_~d~0=v_main_~d~0_9} OutVars{main_~p~0=v_main_~p~0_8, main_~d~0=v_main_~d~0_8} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {3862#(< ~counter~0 20)} is VALID [2022-04-14 21:57:25,369 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3690#true} {3862#(< ~counter~0 20)} [147] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3862#(< ~counter~0 20)} is VALID [2022-04-14 21:57:25,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {3690#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,369 INFO L290 TraceCheckUtils]: 39: Hoare triple {3690#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {3690#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3690#true} is VALID [2022-04-14 21:57:25,369 INFO L272 TraceCheckUtils]: 37: Hoare triple {3862#(< ~counter~0 20)} [128] L46-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~d~0_15 4294967296) (mod (* v_main_~p~0_12 v_main_~B~0_13) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~d~0=v_main_~d~0_15, main_~B~0=v_main_~B~0_13, main_~p~0=v_main_~p~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3690#true} is VALID [2022-04-14 21:57:25,370 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3690#true} {3862#(< ~counter~0 20)} [146] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {3862#(< ~counter~0 20)} is VALID [2022-04-14 21:57:25,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {3690#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {3690#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {3690#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3690#true} is VALID [2022-04-14 21:57:25,370 INFO L272 TraceCheckUtils]: 32: Hoare triple {3862#(< ~counter~0 20)} [123] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~q~0_9 v_main_~B~0_12) v_main_~r~0_12) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~B~0=v_main_~B~0_12, main_~A~0=v_main_~A~0_9, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~B~0, main_~A~0, main_~r~0] {3690#true} is VALID [2022-04-14 21:57:25,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {3862#(< ~counter~0 20)} [119] L45-->L46: Formula: (< |v_main_#t~post7_5| 20) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3862#(< ~counter~0 20)} is VALID [2022-04-14 21:57:25,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {3905#(< ~counter~0 19)} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {3862#(< ~counter~0 20)} is VALID [2022-04-14 21:57:25,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {3905#(< ~counter~0 19)} [136] L38-->L53-2: Formula: (not (<= (mod v_main_~d~0_4 4294967296) (mod v_main_~r~0_4 4294967296))) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {3905#(< ~counter~0 19)} is VALID [2022-04-14 21:57:25,372 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3690#true} {3905#(< ~counter~0 19)} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3905#(< ~counter~0 19)} is VALID [2022-04-14 21:57:25,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {3690#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {3690#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {3690#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3690#true} is VALID [2022-04-14 21:57:25,373 INFO L272 TraceCheckUtils]: 24: Hoare triple {3905#(< ~counter~0 19)} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod v_main_~d~0_14 4294967296) (mod (* v_main_~p~0_11 v_main_~B~0_11) 4294967296)) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {3690#true} is VALID [2022-04-14 21:57:25,373 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3690#true} {3905#(< ~counter~0 19)} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3905#(< ~counter~0 19)} is VALID [2022-04-14 21:57:25,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {3690#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {3690#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {3690#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3690#true} is VALID [2022-04-14 21:57:25,374 INFO L272 TraceCheckUtils]: 19: Hoare triple {3905#(< ~counter~0 19)} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~A~0_8 4294967296) (mod v_main_~r~0_11 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {3690#true} is VALID [2022-04-14 21:57:25,374 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3690#true} {3905#(< ~counter~0 19)} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3905#(< ~counter~0 19)} is VALID [2022-04-14 21:57:25,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {3690#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {3690#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {3690#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3690#true} is VALID [2022-04-14 21:57:25,375 INFO L272 TraceCheckUtils]: 14: Hoare triple {3905#(< ~counter~0 19)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~q~0_8 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {3690#true} is VALID [2022-04-14 21:57:25,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {3905#(< ~counter~0 19)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 20) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3905#(< ~counter~0 19)} is VALID [2022-04-14 21:57:25,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {3960#(< ~counter~0 18)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3905#(< ~counter~0 19)} is VALID [2022-04-14 21:57:25,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {3960#(< ~counter~0 18)} [106] L28-1-->L35-3: Formula: (and (= v_main_~B~0_5 v_main_~d~0_2) (= v_main_~A~0_4 v_main_~r~0_2) (= v_main_~q~0_2 0) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3690#true} {3960#(< ~counter~0 18)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {3690#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {3690#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {3690#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {3690#true} is VALID [2022-04-14 21:57:25,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {3960#(< ~counter~0 18)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {3690#true} is VALID [2022-04-14 21:57:25,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {3960#(< ~counter~0 18)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {3960#(< ~counter~0 18)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3960#(< ~counter~0 18)} {3690#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {3960#(< ~counter~0 18)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {3690#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {3960#(< ~counter~0 18)} is VALID [2022-04-14 21:57:25,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {3690#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#true} is VALID [2022-04-14 21:57:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-14 21:57:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:57:25,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203071275] [2022-04-14 21:57:25,381 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:57:25,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764244173] [2022-04-14 21:57:25,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764244173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 21:57:25,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 21:57:25,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 21:57:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052878898] [2022-04-14 21:57:25,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 21:57:25,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-14 21:57:25,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:57:25,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 21:57:25,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:25,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 21:57:25,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:57:25,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 21:57:25,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 21:57:25,441 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 21:57:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:28,489 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-14 21:57:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 21:57:28,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-14 21:57:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:57:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 21:57:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-04-14 21:57:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 21:57:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-04-14 21:57:28,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 169 transitions. [2022-04-14 21:57:28,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:57:28,644 INFO L225 Difference]: With dead ends: 257 [2022-04-14 21:57:28,644 INFO L226 Difference]: Without dead ends: 257 [2022-04-14 21:57:28,644 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-14 21:57:28,645 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-14 21:57:28,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 299 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-14 21:57:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-14 21:57:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2022-04-14 21:57:28,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:57:28,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 21:57:28,658 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 21:57:28,658 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 21:57:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:28,665 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-14 21:57:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-14 21:57:28,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:28,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:28,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-14 21:57:28,668 INFO L87 Difference]: Start difference. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-14 21:57:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:57:28,675 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-14 21:57:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-14 21:57:28,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:57:28,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:57:28,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:57:28,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:57:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 21:57:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2022-04-14 21:57:28,683 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 50 [2022-04-14 21:57:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:57:28,683 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2022-04-14 21:57:28,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 21:57:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2022-04-14 21:57:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 21:57:28,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:57:28,684 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1] [2022-04-14 21:57:28,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 21:57:28,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:28,897 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:57:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:57:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 451289832, now seen corresponding path program 1 times [2022-04-14 21:57:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:57:28,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538763079] [2022-04-14 21:57:28,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:57:28,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:57:28,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488762944] [2022-04-14 21:57:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:57:28,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:57:28,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:57:28,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:57:28,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process