/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/hard-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:15:55,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:15:55,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:15:55,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:15:55,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:15:55,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:15:55,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:15:55,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:15:55,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:15:55,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:15:55,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:15:55,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:15:55,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:15:55,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:15:55,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:15:55,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:15:55,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:15:55,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:15:55,598 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:15:55,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:15:55,607 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:15:55,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:15:55,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:15:55,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:15:55,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:15:55,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:15:55,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:15:55,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:15:55,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:15:55,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:15:55,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:15:55,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:15:55,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:15:55,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:15:55,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:15:55,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:15:55,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:15:55,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:15:55,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:15:55,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:15:55,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:15:55,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:15:55,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:15:55,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:15:55,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:15:55,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:15:55,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:15:55,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:15:55,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:15:55,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:15:55,631 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:15:55,631 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-27 17:15:55,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:15:55,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:15:55,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:15:55,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:15:55,834 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:15:55,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-27 17:15:55,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539f581e1/7bf8580dda3c4654b91b0e45e23c9457/FLAG668280e3d [2022-04-27 17:15:56,232 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:15:56,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-27 17:15:56,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539f581e1/7bf8580dda3c4654b91b0e45e23c9457/FLAG668280e3d [2022-04-27 17:15:56,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539f581e1/7bf8580dda3c4654b91b0e45e23c9457 [2022-04-27 17:15:56,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:15:56,246 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:15:56,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:15:56,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:15:56,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:15:56,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386a622a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56, skipping insertion in model container [2022-04-27 17:15:56,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:15:56,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:15:56,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c[537,550] [2022-04-27 17:15:56,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:15:56,406 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:15:56,413 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/hard-u.c[537,550] [2022-04-27 17:15:56,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:15:56,425 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:15:56,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56 WrapperNode [2022-04-27 17:15:56,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:15:56,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:15:56,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:15:56,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:15:56,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:15:56,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:15:56,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:15:56,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:15:56,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:15:56,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:15:56,476 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-27 17:15:56,489 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-27 17:15:56,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:15:56,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:15:56,504 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:15:56,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:15:56,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:15:56,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:15:56,505 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:15:56,505 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:15:56,505 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:15:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:15:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 17:15:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:15:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:15:56,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:15:56,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:15:56,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:15:56,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:15:56,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:15:56,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:15:56,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:15:56,554 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:15:56,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:15:56,681 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:15:56,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:15:56,686 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:15:56,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:15:56 BoogieIcfgContainer [2022-04-27 17:15:56,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:15:56,688 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:15:56,688 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:15:56,689 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:15:56,705 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:15:56" (1/1) ... [2022-04-27 17:15:56,707 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:15:56,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:15:56 BasicIcfg [2022-04-27 17:15:56,738 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:15:56,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:15:56,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:15:56,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:15:56,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:15:56" (1/4) ... [2022-04-27 17:15:56,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9147a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:15:56, skipping insertion in model container [2022-04-27 17:15:56,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:15:56" (2/4) ... [2022-04-27 17:15:56,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9147a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:15:56, skipping insertion in model container [2022-04-27 17:15:56,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:15:56" (3/4) ... [2022-04-27 17:15:56,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b9147a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:15:56, skipping insertion in model container [2022-04-27 17:15:56,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:15:56" (4/4) ... [2022-04-27 17:15:56,743 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u.cJordan [2022-04-27 17:15:56,756 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:15:56,756 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:15:56,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:15:56,786 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2641b35f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ae3c5f9 [2022-04-27 17:15:56,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:15:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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-27 17:15:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:15:56,796 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:15:56,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:15:56,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:15:56,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:15:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1625753047, now seen corresponding path program 1 times [2022-04-27 17:15:56,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:15:56,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47072015] [2022-04-27 17:15:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:15:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:15:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:15:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:56,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 17:15:56,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 17:15:56,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 17:15:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:15:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:56,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} [105] 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] {38#true} is VALID [2022-04-27 17:15:56,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 17:15:56,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 17:15:56,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L27-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] {39#false} is VALID [2022-04-27 17:15:56,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:15:56,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 17:15:56,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 17:15:56,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 17:15:56,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 17:15:56,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {38#true} is VALID [2022-04-27 17:15:56,925 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} [103] L27-->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] {38#true} is VALID [2022-04-27 17:15:56,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} [105] 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] {38#true} is VALID [2022-04-27 17:15:56,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} [109] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 17:15:56,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 17:15:56,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} [137] assume_abort_if_notEXIT-->L27-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] {39#false} is VALID [2022-04-27 17:15:56,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {39#false} is VALID [2022-04-27 17:15:56,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 17:15:56,927 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} [114] L35-->__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] {39#false} is VALID [2022-04-27 17:15:56,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} [119] __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] {39#false} is VALID [2022-04-27 17:15:56,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} [123] 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[] {39#false} is VALID [2022-04-27 17:15:56,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 17:15:56,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-27 17:15:56,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:15:56,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47072015] [2022-04-27 17:15:56,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47072015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:15:56,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:15:56,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:15:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892650779] [2022-04-27 17:15:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:15:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-27 17:15:56,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:15:56,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-27 17:15:56,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:56,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:15:56,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:15:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:15:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:15:56,966 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-27 17:15:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:57,112 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 17:15:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:15:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-27 17:15:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:15:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-27 17:15:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 17:15:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-27 17:15:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 17:15:57,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-04-27 17:15:57,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:57,212 INFO L225 Difference]: With dead ends: 35 [2022-04-27 17:15:57,212 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 17:15:57,213 INFO L412 NwaCegarLoop]: 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-27 17:15:57,215 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:15:57,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:15:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 17:15:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 17:15:57,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:15:57,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-27 17:15:57,235 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-27 17:15:57,236 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-27 17:15:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:57,239 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 17:15:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 17:15:57,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:15:57,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:15:57,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 30 states. [2022-04-27 17:15:57,241 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 30 states. [2022-04-27 17:15:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:57,243 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 17:15:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 17:15:57,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:15:57,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:15:57,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:15:57,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:15:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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-27 17:15:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-27 17:15:57,247 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-27 17:15:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:15:57,248 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-27 17:15:57,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-27 17:15:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 17:15:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 17:15:57,248 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:15:57,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:15:57,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:15:57,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:15:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:15:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash 861759786, now seen corresponding path program 1 times [2022-04-27 17:15:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:15:57,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999756985] [2022-04-27 17:15:57,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:15:57,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:15:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:15:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {175#true} is VALID [2022-04-27 17:15:57,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:15:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} [105] 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] {175#true} is VALID [2022-04-27 17:15:57,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} [110] 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[] {175#true} is VALID [2022-04-27 17:15:57,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {175#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175#true} {175#true} [137] assume_abort_if_notEXIT-->L27-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] {175#true} is VALID [2022-04-27 17:15:57,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {175#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:15:57,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {175#true} is VALID [2022-04-27 17:15:57,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {175#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {175#true} {175#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {175#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {175#true} is VALID [2022-04-27 17:15:57,323 INFO L272 TraceCheckUtils]: 6: Hoare triple {175#true} [103] L27-->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] {175#true} is VALID [2022-04-27 17:15:57,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {175#true} [105] 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] {175#true} is VALID [2022-04-27 17:15:57,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {175#true} [110] 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[] {175#true} is VALID [2022-04-27 17:15:57,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#true} is VALID [2022-04-27 17:15:57,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {175#true} {175#true} [137] assume_abort_if_notEXIT-->L27-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] {175#true} is VALID [2022-04-27 17:15:57,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {184#(= main_~q~0 0)} is VALID [2022-04-27 17:15:57,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(= main_~q~0 0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {184#(= main_~q~0 0)} is VALID [2022-04-27 17:15:57,325 INFO L272 TraceCheckUtils]: 13: Hoare triple {184#(= main_~q~0 0)} [114] L35-->__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] {185#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:15:57,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {185#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __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] {186#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:15:57,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(not (= __VERIFIER_assert_~cond 0))} [123] 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[] {176#false} is VALID [2022-04-27 17:15:57,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {176#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {176#false} is VALID [2022-04-27 17:15:57,326 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-27 17:15:57,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:15:57,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999756985] [2022-04-27 17:15:57,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999756985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:15:57,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:15:57,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:15:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58869485] [2022-04-27 17:15:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:15:57,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 17:15:57,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:15:57,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:15:57,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:57,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:15:57,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:15:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:15:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:15:57,342 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:15:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:57,740 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 17:15:57,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:15:57,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 17:15:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:15:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:15:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 17:15:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:15:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 17:15:57,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-27 17:15:57,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:57,804 INFO L225 Difference]: With dead ends: 41 [2022-04-27 17:15:57,804 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 17:15:57,806 INFO L412 NwaCegarLoop]: 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-27 17:15:57,808 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 17:15:57,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 17:15:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 17:15:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-27 17:15:57,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:15:57,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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-27 17:15:57,818 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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-27 17:15:57,818 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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-27 17:15:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:57,821 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 17:15:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 17:15:57,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:15:57,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:15:57,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 41 states. [2022-04-27 17:15:57,830 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 41 states. [2022-04-27 17:15:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:57,841 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 17:15:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 17:15:57,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:15:57,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:15:57,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:15:57,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:15:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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-27 17:15:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-27 17:15:57,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-27 17:15:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:15:57,858 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-27 17:15:57,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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-27 17:15:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 17:15:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 17:15:57,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:15:57,858 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:15:57,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:15:57,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:15:57,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:15:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash 325569287, now seen corresponding path program 1 times [2022-04-27 17:15:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:15:57,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153462216] [2022-04-27 17:15:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:15:57,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:15:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:15:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {355#true} is VALID [2022-04-27 17:15:57,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {355#true} {355#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:15:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#true} [105] 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] {355#true} is VALID [2022-04-27 17:15:57,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [110] 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[] {355#true} is VALID [2022-04-27 17:15:57,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [137] assume_abort_if_notEXIT-->L27-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] {355#true} is VALID [2022-04-27 17:15:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 17:15:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:57,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {355#true} [119] __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] {355#true} is VALID [2022-04-27 17:15:57,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {355#true} [124] 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[] {355#true} is VALID [2022-04-27 17:15:57,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [138] __VERIFIER_assertEXIT-->L35-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] {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 17:15:57,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {355#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:15:57,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {355#true} is VALID [2022-04-27 17:15:57,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {355#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355#true} {355#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {355#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {355#true} is VALID [2022-04-27 17:15:57,983 INFO L272 TraceCheckUtils]: 6: Hoare triple {355#true} [103] L27-->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] {355#true} is VALID [2022-04-27 17:15:57,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#true} [105] 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] {355#true} is VALID [2022-04-27 17:15:57,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {355#true} [110] 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[] {355#true} is VALID [2022-04-27 17:15:57,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,984 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {355#true} {355#true} [137] assume_abort_if_notEXIT-->L27-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] {355#true} is VALID [2022-04-27 17:15:57,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 17:15:57,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 17:15:57,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [114] L35-->__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] {355#true} is VALID [2022-04-27 17:15:57,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {355#true} [119] __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] {355#true} is VALID [2022-04-27 17:15:57,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {355#true} [124] 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[] {355#true} is VALID [2022-04-27 17:15:57,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {355#true} is VALID [2022-04-27 17:15:57,987 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {355#true} {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [138] __VERIFIER_assertEXIT-->L35-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] {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 17:15:57,988 INFO L272 TraceCheckUtils]: 18: Hoare triple {364#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} [118] L35-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] {369#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:15:57,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#(not (= |__VERIFIER_assert_#in~cond| 0))} [119] __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] {370#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:15:57,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#(not (= __VERIFIER_assert_~cond 0))} [123] 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[] {356#false} is VALID [2022-04-27 17:15:57,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {356#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {356#false} is VALID [2022-04-27 17:15:57,990 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-27 17:15:57,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:15:57,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153462216] [2022-04-27 17:15:57,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153462216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:15:57,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:15:57,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:15:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480340774] [2022-04-27 17:15:57,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:15:57,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 17:15:57,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:15:57,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:15:58,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:15:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:15:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:15:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:15:58,016 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:15:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:58,399 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 17:15:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:15:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 17:15:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:15:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:15:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 17:15:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:15:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-27 17:15:58,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-27 17:15:58,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:58,450 INFO L225 Difference]: With dead ends: 45 [2022-04-27 17:15:58,451 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 17:15:58,451 INFO L412 NwaCegarLoop]: 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-27 17:15:58,452 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 17:15:58,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 17:15:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 17:15:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-27 17:15:58,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:15:58,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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-27 17:15:58,457 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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-27 17:15:58,457 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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-27 17:15:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:58,459 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 17:15:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 17:15:58,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:15:58,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:15:58,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 45 states. [2022-04-27 17:15:58,460 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 45 states. [2022-04-27 17:15:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:15:58,464 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 17:15:58,464 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 17:15:58,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:15:58,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:15:58,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:15:58,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:15:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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-27 17:15:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 17:15:58,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-27 17:15:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:15:58,466 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 17:15:58,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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-27 17:15:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 17:15:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 17:15:58,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:15:58,466 INFO L195 NwaCegarLoop]: 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] [2022-04-27 17:15:58,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 17:15:58,467 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:15:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:15:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1461652409, now seen corresponding path program 1 times [2022-04-27 17:15:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:15:58,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297636149] [2022-04-27 17:15:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:15:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:15:58,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:15:58,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569544928] [2022-04-27 17:15:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:15:58,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:15:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:15:58,479 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-27 17:15:58,491 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-27 17:15:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:58,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 17:15:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:15:58,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:15:59,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {555#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 17:15:59,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {555#true} is VALID [2022-04-27 17:15:59,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {555#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 17:15:59,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 17:15:59,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {555#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 17:15:59,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {555#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {555#true} is VALID [2022-04-27 17:15:59,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {555#true} [103] L27-->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] {555#true} is VALID [2022-04-27 17:15:59,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#true} [105] 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] {581#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 17:15:59,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {581#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [110] 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[] {585#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:15:59,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#(not (= |assume_abort_if_not_#in~cond| 0))} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {585#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:15:59,042 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {585#(not (= |assume_abort_if_not_#in~cond| 0))} {555#true} [137] assume_abort_if_notEXIT-->L27-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] {592#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 17:15:59,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= 1 (mod main_~B~0 4294967296))} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:15:59,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:15:59,043 INFO L272 TraceCheckUtils]: 13: Hoare triple {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__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] {555#true} is VALID [2022-04-27 17:15:59,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#true} [119] __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] {555#true} is VALID [2022-04-27 17:15:59,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#true} [124] 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[] {555#true} is VALID [2022-04-27 17:15:59,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {555#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 17:15:59,056 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {555#true} {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-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] {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:15:59,056 INFO L272 TraceCheckUtils]: 18: Hoare triple {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-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] {555#true} is VALID [2022-04-27 17:15:59,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {555#true} [119] __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] {555#true} is VALID [2022-04-27 17:15:59,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {555#true} [124] 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[] {555#true} is VALID [2022-04-27 17:15:59,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {555#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {555#true} is VALID [2022-04-27 17:15:59,059 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {555#true} {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: 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] {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:15:59,060 INFO L272 TraceCheckUtils]: 23: Hoare triple {596#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__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] {633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:15:59,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {633#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:15:59,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {637#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {556#false} is VALID [2022-04-27 17:15:59,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {556#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {556#false} is VALID [2022-04-27 17:15:59,062 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-27 17:15:59,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:15:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:15:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297636149] [2022-04-27 17:15:59,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:15:59,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569544928] [2022-04-27 17:15:59,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569544928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:15:59,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:15:59,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 17:15:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744371573] [2022-04-27 17:15:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:15:59,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 17:15:59,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:15:59,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:15:59,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:15:59,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:15:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:15:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:15:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:15:59,085 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:16:01,293 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-27 17:16:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:01,602 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-04-27 17:16:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:16:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 17:16:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:16:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:16:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-04-27 17:16:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:16:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-04-27 17:16:01,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2022-04-27 17:16:01,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:16:01,686 INFO L225 Difference]: With dead ends: 59 [2022-04-27 17:16:01,686 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 17:16:01,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:16:01,687 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:16:01,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 185 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 17:16:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 17:16:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-27 17:16:01,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:16:01,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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-27 17:16:01,691 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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-27 17:16:01,692 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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-27 17:16:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:01,694 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 17:16:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-04-27 17:16:01,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:16:01,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:16:01,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 58 states. [2022-04-27 17:16:01,695 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 58 states. [2022-04-27 17:16:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:01,697 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 17:16:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-04-27 17:16:01,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:16:01,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:16:01,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:16:01,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:16:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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-27 17:16:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-04-27 17:16:01,700 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2022-04-27 17:16:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:16:01,700 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-04-27 17:16:01,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:16:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-27 17:16:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 17:16:01,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:16:01,701 INFO L195 NwaCegarLoop]: 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] [2022-04-27 17:16:01,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 17:16:01,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:16:01,915 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:16:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:16:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1008917278, now seen corresponding path program 1 times [2022-04-27 17:16:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:16:01,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108240988] [2022-04-27 17:16:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:16:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:16:01,929 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:16:01,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769314037] [2022-04-27 17:16:01,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:16:01,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:16:01,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:16:01,935 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-27 17:16:01,936 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-27 17:16:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:16:01,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 17:16:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:16:01,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:16:02,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {874#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {874#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {874#true} is VALID [2022-04-27 17:16:02,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {874#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {874#true} {874#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {874#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {874#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {874#true} is VALID [2022-04-27 17:16:02,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {874#true} [103] L27-->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] {874#true} is VALID [2022-04-27 17:16:02,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {874#true} [105] 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] {874#true} is VALID [2022-04-27 17:16:02,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {874#true} [110] 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[] {874#true} is VALID [2022-04-27 17:16:02,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {874#true} {874#true} [137] assume_abort_if_notEXIT-->L27-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] {874#true} is VALID [2022-04-27 17:16:02,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 17:16:02,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 17:16:02,431 INFO L272 TraceCheckUtils]: 13: Hoare triple {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [114] L35-->__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] {874#true} is VALID [2022-04-27 17:16:02,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {874#true} [119] __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] {874#true} is VALID [2022-04-27 17:16:02,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {874#true} [124] 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[] {874#true} is VALID [2022-04-27 17:16:02,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {874#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,432 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {874#true} {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [138] __VERIFIER_assertEXIT-->L35-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] {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 17:16:02,432 INFO L272 TraceCheckUtils]: 18: Hoare triple {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [118] L35-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] {874#true} is VALID [2022-04-27 17:16:02,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#true} [119] __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] {874#true} is VALID [2022-04-27 17:16:02,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {874#true} [124] 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[] {874#true} is VALID [2022-04-27 17:16:02,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {874#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,433 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {874#true} {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [139] __VERIFIER_assertEXIT-->L36: 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] {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 17:16:02,433 INFO L272 TraceCheckUtils]: 23: Hoare triple {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [122] L36-->__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] {874#true} is VALID [2022-04-27 17:16:02,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {874#true} [119] __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] {874#true} is VALID [2022-04-27 17:16:02,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {874#true} [124] 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[] {874#true} is VALID [2022-04-27 17:16:02,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {874#true} is VALID [2022-04-27 17:16:02,434 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {874#true} {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [140] __VERIFIER_assertEXIT-->L37: 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] {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 17:16:02,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} [128] L37-->L52-2: Formula: (not (<= (mod v_main_~d~0_11 4294967296) (mod v_main_~r~0_9 4294967296))) InVars {main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} OutVars{main_~d~0=v_main_~d~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[] {964#(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-27 17:16:02,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {964#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [113] L52-2-->L45: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {964#(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-27 17:16:02,435 INFO L272 TraceCheckUtils]: 30: Hoare triple {964#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} [117] L45-->__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] {971#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:16:02,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {971#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {975#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:16:02,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {975#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {875#false} is VALID [2022-04-27 17:16:02,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {875#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {875#false} is VALID [2022-04-27 17:16:02,436 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-27 17:16:02,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:16:02,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:16:02,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108240988] [2022-04-27 17:16:02,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:16:02,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769314037] [2022-04-27 17:16:02,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769314037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:16:02,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:16:02,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:16:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588229491] [2022-04-27 17:16:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:16:02,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 34 [2022-04-27 17:16:02,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:16:02,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:02,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:16:02,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:16:02,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:16:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:16:02,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:16:02,467 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:04,983 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-04-27 17:16:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 17:16:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 34 [2022-04-27 17:16:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:16:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-04-27 17:16:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-04-27 17:16:04,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 71 transitions. [2022-04-27 17:16:05,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:16:05,065 INFO L225 Difference]: With dead ends: 71 [2022-04-27 17:16:05,065 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 17:16:05,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:16:05,066 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 17:16:05,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 17:16:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 17:16:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-27 17:16:05,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:16:05,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:16:05,070 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:16:05,070 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:16:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:05,073 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 17:16:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 17:16:05,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:16:05,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:16:05,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-27 17:16:05,074 INFO L87 Difference]: Start difference. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-27 17:16:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:05,075 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 17:16:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 17:16:05,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:16:05,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:16:05,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:16:05,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:16:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 17:16:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-27 17:16:05,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 34 [2022-04-27 17:16:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:16:05,078 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-27 17:16:05,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-27 17:16:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 17:16:05,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:16:05,079 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:16:05,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 17:16:05,312 WARN L477 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-27 17:16:05,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:16:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:16:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1762200840, now seen corresponding path program 1 times [2022-04-27 17:16:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:16:05,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678475554] [2022-04-27 17:16:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:16:05,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:16:05,331 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:16:05,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844549910] [2022-04-27 17:16:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:16:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:16:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:16:05,347 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-27 17:16:05,348 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-27 17:16:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:16:05,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 17:16:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:16:05,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:16:05,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {1265#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1265#true} is VALID [2022-04-27 17:16:05,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {1265#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1265#true} {1265#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {1265#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1265#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {1265#true} is VALID [2022-04-27 17:16:05,632 INFO L272 TraceCheckUtils]: 6: Hoare triple {1265#true} [103] L27-->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] {1265#true} is VALID [2022-04-27 17:16:05,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#true} [105] 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] {1265#true} is VALID [2022-04-27 17:16:05,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#true} [110] 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[] {1265#true} is VALID [2022-04-27 17:16:05,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {1265#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1265#true} {1265#true} [137] assume_abort_if_notEXIT-->L27-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] {1265#true} is VALID [2022-04-27 17:16:05,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {1265#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:16:05,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:16:05,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [114] L35-->__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] {1265#true} is VALID [2022-04-27 17:16:05,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:05,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:05,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,634 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1265#true} {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [138] __VERIFIER_assertEXIT-->L35-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] {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:16:05,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [118] L35-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] {1265#true} is VALID [2022-04-27 17:16:05,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:05,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:05,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,635 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1265#true} {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [139] __VERIFIER_assertEXIT-->L36: 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] {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:16:05,635 INFO L272 TraceCheckUtils]: 23: Hoare triple {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [122] L36-->__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] {1265#true} is VALID [2022-04-27 17:16:05,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:05,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:05,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,635 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1265#true} {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [140] __VERIFIER_assertEXIT-->L37: 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] {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 17:16:05,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} [129] L37-->L34-2: Formula: (and (<= (mod v_main_~d~0_13 4294967296) (mod v_main_~r~0_10 4294967296)) (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 17:16:05,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 17:16:05,636 INFO L272 TraceCheckUtils]: 30: Hoare triple {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [114] L35-->__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] {1265#true} is VALID [2022-04-27 17:16:05,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:05,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:05,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,638 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1265#true} {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [138] __VERIFIER_assertEXIT-->L35-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] {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 17:16:05,638 INFO L272 TraceCheckUtils]: 35: Hoare triple {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [118] L35-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] {1265#true} is VALID [2022-04-27 17:16:05,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:05,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:05,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:05,639 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1265#true} {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [139] __VERIFIER_assertEXIT-->L36: 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] {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 17:16:05,642 INFO L272 TraceCheckUtils]: 40: Hoare triple {1355#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} [122] L36-->__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] {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:16:05,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:16:05,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {1396#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1266#false} is VALID [2022-04-27 17:16:05,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {1266#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#false} is VALID [2022-04-27 17:16:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 17:16:05,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:16:06,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {1266#false} [130] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1266#false} is VALID [2022-04-27 17:16:06,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {1396#(<= 1 __VERIFIER_assert_~cond)} [123] 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[] {1266#false} is VALID [2022-04-27 17:16:06,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} [119] __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] {1396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:16:06,043 INFO L272 TraceCheckUtils]: 40: Hoare triple {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [122] L36-->__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] {1392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:16:06,044 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1265#true} {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [139] __VERIFIER_assertEXIT-->L36: 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] {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 17:16:06,044 INFO L290 TraceCheckUtils]: 38: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:06,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:06,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:06,044 INFO L272 TraceCheckUtils]: 35: Hoare triple {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [118] L35-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] {1265#true} is VALID [2022-04-27 17:16:06,045 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1265#true} {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [138] __VERIFIER_assertEXIT-->L35-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] {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 17:16:06,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:06,045 INFO L290 TraceCheckUtils]: 32: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:06,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:06,045 INFO L272 TraceCheckUtils]: 30: Hoare triple {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [114] L35-->__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] {1265#true} is VALID [2022-04-27 17:16:06,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 17:16:08,076 WARN L290 TraceCheckUtils]: 28: Hoare triple {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [129] L37-->L34-2: Formula: (and (<= (mod v_main_~d~0_13 4294967296) (mod v_main_~r~0_10 4294967296)) (= v_main_~p~0_9 (* v_main_~p~0_10 2)) (= (* 2 v_main_~d~0_13) v_main_~d~0_12)) InVars {main_~d~0=v_main_~d~0_13, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10} OutVars{main_~d~0=v_main_~d~0_12, main_~p~0=v_main_~p~0_9, main_~r~0=v_main_~r~0_10} AuxVars[] AssignedVars[main_~d~0, main_~p~0] {1412#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 17:16:08,077 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1265#true} {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [140] __VERIFIER_assertEXIT-->L37: 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] {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 17:16:08,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:08,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:08,077 INFO L272 TraceCheckUtils]: 23: Hoare triple {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [122] L36-->__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] {1265#true} is VALID [2022-04-27 17:16:08,078 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1265#true} {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [139] __VERIFIER_assertEXIT-->L36: 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] {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 17:16:08,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:08,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:08,078 INFO L272 TraceCheckUtils]: 18: Hoare triple {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [118] L35-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] {1265#true} is VALID [2022-04-27 17:16:08,079 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1265#true} {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [138] __VERIFIER_assertEXIT-->L35-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] {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 17:16:08,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#true} [132] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {1265#true} [124] 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[] {1265#true} is VALID [2022-04-27 17:16:08,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {1265#true} [119] __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] {1265#true} is VALID [2022-04-27 17:16:08,079 INFO L272 TraceCheckUtils]: 13: Hoare triple {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [114] L35-->__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] {1265#true} is VALID [2022-04-27 17:16:08,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} [108] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 17:16:08,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {1265#true} [104] L27-1-->L34-2: Formula: (and (= v_main_~p~0_3 1) (= v_main_~A~0_5 v_main_~r~0_3) (= v_main_~B~0_7 v_main_~d~0_3) (= v_main_~q~0_3 0)) InVars {main_~A~0=v_main_~A~0_5, main_~B~0=v_main_~B~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~d~0=v_main_~d~0_3, main_~B~0=v_main_~B~0_7, main_~A~0=v_main_~A~0_5, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1449#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 17:16:08,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1265#true} {1265#true} [137] assume_abort_if_notEXIT-->L27-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] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1265#true} [115] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#true} [110] 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[] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#true} [105] 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] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {1265#true} [103] L27-->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] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {1265#true} [101] mainENTRY-->L27: Formula: (and (= v_main_~B~0_2 |v_main_#t~nondet5_2|) (= v_main_~A~0_2 |v_main_#t~nondet4_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_2, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_2} 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] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {1265#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1265#true} {1265#true} [136] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {1265#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1265#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1265#true} is VALID [2022-04-27 17:16:08,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {1265#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1265#true} is VALID [2022-04-27 17:16:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 17:16:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:16:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678475554] [2022-04-27 17:16:08,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:16:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844549910] [2022-04-27 17:16:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844549910] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 17:16:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 17:16:08,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 17:16:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221482459] [2022-04-27 17:16:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:16:08,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 44 [2022-04-27 17:16:08,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:16:08,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:10,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 17:16:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:16:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:16:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:16:10,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:16:10,130 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:13,070 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-27 17:16:15,505 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-27 17:16:17,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:17,445 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 17:16:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:16:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 44 [2022-04-27 17:16:17,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:16:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-27 17:16:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-04-27 17:16:17,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 52 transitions. [2022-04-27 17:16:19,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 17:16:19,502 INFO L225 Difference]: With dead ends: 79 [2022-04-27 17:16:19,502 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 17:16:19,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 17:16:19,503 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-27 17:16:19,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 111 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-27 17:16:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 17:16:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-27 17:16:19,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:16:19,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:16:19,507 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:16:19,507 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:16:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:19,509 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 17:16:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 17:16:19,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:16:19,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:16:19,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-27 17:16:19,510 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-27 17:16:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:16:19,513 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 17:16:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 17:16:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:16:19,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:16:19,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:16:19,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:16:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 17:16:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-27 17:16:19,515 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 44 [2022-04-27 17:16:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:16:19,515 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-27 17:16:19,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-27 17:16:19,516 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-27 17:16:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 17:16:19,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:16:19,516 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:16:19,522 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-27 17:16:19,720 WARN L477 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-27 17:16:19,722 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:16:19,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:16:19,723 INFO L85 PathProgramCache]: Analyzing trace with hash 582060793, now seen corresponding path program 1 times [2022-04-27 17:16:19,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:16:19,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815279142] [2022-04-27 17:16:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:16:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:16:19,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:16:19,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490610527] [2022-04-27 17:16:19,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:16:19,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:16:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:16:19,738 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-27 17:16:19,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process