/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:39:49,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:39:49,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:39:49,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:39:49,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:39:49,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:39:49,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:39:49,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:39:49,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:39:49,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:39:49,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:39:49,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:39:49,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:39:49,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:39:49,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:39:49,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:39:49,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:39:49,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:39:49,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:39:49,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:39:49,705 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:39:49,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:39:49,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:39:49,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:39:49,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:39:49,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:39:49,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:39:49,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:39:49,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:39:49,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:39:49,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:39:49,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:39:49,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:39:49,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:39:49,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:39:49,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:39:49,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:39:49,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:39:49,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:39:49,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:39:49,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:39:49,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:39:49,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:39:49,744 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:39:49,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:39:49,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:39:49,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:39:49,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:39:49,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:39:49,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:39:49,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:39:49,746 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:39:49,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:39:49,746 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:39:49,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:39:49,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:39:49,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:39:49,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:39:49,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:39:49,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:39:49,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 13:39:49,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:39:49,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:39:49,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:39:49,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:39:49,947 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:39:49,948 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c [2022-04-27 13:39:49,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb6819af/6099cdbed83d40fe94fa12c1eef09046/FLAG5fa04b0e7 [2022-04-27 13:39:50,346 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:39:50,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c [2022-04-27 13:39:50,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb6819af/6099cdbed83d40fe94fa12c1eef09046/FLAG5fa04b0e7 [2022-04-27 13:39:50,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebb6819af/6099cdbed83d40fe94fa12c1eef09046 [2022-04-27 13:39:50,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:39:50,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:39:50,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:39:50,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:39:50,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:39:50,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411598b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50, skipping insertion in model container [2022-04-27 13:39:50,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:39:50,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:39:50,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2022-04-27 13:39:50,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:39:50,948 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:39:50,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound50.c[537,550] [2022-04-27 13:39:50,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:39:50,973 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:39:50,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50 WrapperNode [2022-04-27 13:39:50,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:39:50,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:39:50,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:39:50,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:39:50,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:50,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:39:50,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:39:50,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:39:50,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:39:50,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (1/1) ... [2022-04-27 13:39:51,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:39:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:39:51,044 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 13:39:51,057 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 13:39:51,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:39:51,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:39:51,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:39:51,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:39:51,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:39:51,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:39:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:39:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:39:51,079 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:39:51,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:39:51,126 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:39:51,127 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:39:51,264 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:39:51,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:39:51,270 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:39:51,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:39:51 BoogieIcfgContainer [2022-04-27 13:39:51,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:39:51,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:39:51,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:39:51,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:39:51,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:39:50" (1/3) ... [2022-04-27 13:39:51,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c1083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:39:51, skipping insertion in model container [2022-04-27 13:39:51,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:39:50" (2/3) ... [2022-04-27 13:39:51,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c1083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:39:51, skipping insertion in model container [2022-04-27 13:39:51,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:39:51" (3/3) ... [2022-04-27 13:39:51,277 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound50.c [2022-04-27 13:39:51,286 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:39:51,287 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:39:51,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:39:51,323 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@732939da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@26eacf3b [2022-04-27 13:39:51,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:39:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 13:39:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:39:51,351 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:39:51,351 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:39:51,352 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:39:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:39:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 1 times [2022-04-27 13:39:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:39:51,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311545784] [2022-04-27 13:39:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:51,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:39:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:39:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:51,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 13:39:51,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 13:39:51,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-27 13:39:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:39:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:51,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:39:51,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:39:51,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:39:51,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 13:39:51,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:39:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:51,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:39:51,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:39:51,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:39:51,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 13:39:51,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:39:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:51,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:39:51,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:39:51,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:39:51,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-27 13:39:51,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:39:51,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 13:39:51,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 13:39:51,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-27 13:39:51,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret6 := main(); {41#true} is VALID [2022-04-27 13:39:51,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-27 13:39:51,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {41#true} is VALID [2022-04-27 13:39:51,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:39:51,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:39:51,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:39:51,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 13:39:51,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~B~0 := #t~nondet5;havoc #t~nondet5; {42#false} is VALID [2022-04-27 13:39:51,644 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {41#true} is VALID [2022-04-27 13:39:51,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:39:51,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:39:51,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:39:51,648 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 13:39:51,648 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-27 13:39:51,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:39:51,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:39:51,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:39:51,649 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-27 13:39:51,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {42#false} is VALID [2022-04-27 13:39:51,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 13:39:51,649 INFO L272 TraceCheckUtils]: 24: Hoare triple {42#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-27 13:39:51,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 13:39:51,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 13:39:51,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 13:39:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:39:51,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:39:51,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311545784] [2022-04-27 13:39:51,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311545784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:39:51,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:39:51,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:39:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523270568] [2022-04-27 13:39:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:39:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:39:51,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:39:51,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:39:51,697 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 13:39:51,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:39:51,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:39:51,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:39:51,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:39:51,721 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:39:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:51,911 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-04-27 13:39:51,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:39:51,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:39:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:39:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:39:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 13:39:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:39:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 13:39:51,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-27 13:39:52,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:52,082 INFO L225 Difference]: With dead ends: 69 [2022-04-27 13:39:52,083 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:39:52,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:39:52,090 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:39:52,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:39:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:39:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 13:39:52,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:39:52,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,123 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,123 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:52,131 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:39:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:39:52,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:52,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:52,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-27 13:39:52,134 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-27 13:39:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:52,138 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:39:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:39:52,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:52,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:52,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:39:52,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:39:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 13:39:52,144 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-27 13:39:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:39:52,144 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 13:39:52,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:39:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:39:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:39:52,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:39:52,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:39:52,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:39:52,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:39:52,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:39:52,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 1 times [2022-04-27 13:39:52,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:39:52,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949908066] [2022-04-27 13:39:52,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:52,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:39:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:39:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-04-27 13:39:52,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #101#return; {275#true} is VALID [2022-04-27 13:39:52,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:39:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:39:52,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:39:52,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #81#return; {275#true} is VALID [2022-04-27 13:39:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:39:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:39:52,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:39:52,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 13:39:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:39:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:39:52,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:39:52,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #85#return; {275#true} is VALID [2022-04-27 13:39:52,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:39:52,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-04-27 13:39:52,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #101#return; {275#true} is VALID [2022-04-27 13:39:52,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret6 := main(); {275#true} is VALID [2022-04-27 13:39:52,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {275#true} is VALID [2022-04-27 13:39:52,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {275#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {275#true} is VALID [2022-04-27 13:39:52,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:39:52,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:39:52,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {275#true} {275#true} #81#return; {275#true} is VALID [2022-04-27 13:39:52,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {275#true} is VALID [2022-04-27 13:39:52,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {275#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {275#true} is VALID [2022-04-27 13:39:52,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:39:52,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:39:52,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,276 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 13:39:52,277 INFO L272 TraceCheckUtils]: 17: Hoare triple {275#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {275#true} is VALID [2022-04-27 13:39:52,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:39:52,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:39:52,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:39:52,277 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {275#true} {275#true} #85#return; {275#true} is VALID [2022-04-27 13:39:52,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {275#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {292#(= main_~q~0 0)} is VALID [2022-04-27 13:39:52,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {292#(= main_~q~0 0)} assume !false; {292#(= main_~q~0 0)} is VALID [2022-04-27 13:39:52,279 INFO L272 TraceCheckUtils]: 24: Hoare triple {292#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {293#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:39:52,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {293#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {294#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:39:52,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {276#false} is VALID [2022-04-27 13:39:52,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 13:39:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:39:52,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:39:52,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949908066] [2022-04-27 13:39:52,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949908066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:39:52,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:39:52,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:39:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914584079] [2022-04-27 13:39:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:39:52,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 13:39:52,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:39:52,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:39:52,300 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 13:39:52,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:39:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:39:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:39:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:39:52,301 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:39:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:52,739 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:39:52,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:39:52,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-27 13:39:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:39:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:39:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:39:52,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:39:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:39:52,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 13:39:52,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:52,802 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:39:52,802 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:39:52,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:39:52,804 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:39:52,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:39:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:39:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-27 13:39:52,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:39:52,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,810 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,810 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:52,812 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:39:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:39:52,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:52,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:52,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-27 13:39:52,814 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-27 13:39:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:52,816 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:39:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:39:52,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:52,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:52,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:39:52,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:39:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 13:39:52,819 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-27 13:39:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:39:52,819 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 13:39:52,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 13:39:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 13:39:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:39:52,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:39:52,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:39:52,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:39:52,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:39:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:39:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 1 times [2022-04-27 13:39:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:39:52,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146996977] [2022-04-27 13:39:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:39:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:39:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-04-27 13:39:52,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {517#true} {517#true} #101#return; {517#true} is VALID [2022-04-27 13:39:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:39:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #81#return; {517#true} is VALID [2022-04-27 13:39:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:39:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #83#return; {517#true} is VALID [2022-04-27 13:39:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:39:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #85#return; {517#true} is VALID [2022-04-27 13:39:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 13:39:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:52,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {534#(= main_~A~0 main_~r~0)} #87#return; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:39:52,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {517#true} call ULTIMATE.init(); {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:39:52,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {517#true} is VALID [2022-04-27 13:39:52,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #101#return; {517#true} is VALID [2022-04-27 13:39:52,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret6 := main(); {517#true} is VALID [2022-04-27 13:39:52,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {517#true} is VALID [2022-04-27 13:39:52,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {517#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {517#true} is VALID [2022-04-27 13:39:52,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {517#true} {517#true} #81#return; {517#true} is VALID [2022-04-27 13:39:52,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {517#true} is VALID [2022-04-27 13:39:52,935 INFO L272 TraceCheckUtils]: 12: Hoare triple {517#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {517#true} is VALID [2022-04-27 13:39:52,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,936 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {517#true} {517#true} #83#return; {517#true} is VALID [2022-04-27 13:39:52,936 INFO L272 TraceCheckUtils]: 17: Hoare triple {517#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {517#true} is VALID [2022-04-27 13:39:52,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,936 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {517#true} {517#true} #85#return; {517#true} is VALID [2022-04-27 13:39:52,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {517#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:39:52,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {534#(= main_~A~0 main_~r~0)} assume !false; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:39:52,937 INFO L272 TraceCheckUtils]: 24: Hoare triple {534#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {517#true} is VALID [2022-04-27 13:39:52,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:39:52,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:39:52,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:39:52,938 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {517#true} {534#(= main_~A~0 main_~r~0)} #87#return; {534#(= main_~A~0 main_~r~0)} is VALID [2022-04-27 13:39:52,939 INFO L272 TraceCheckUtils]: 29: Hoare triple {534#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {539#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:39:52,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {539#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {540#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:39:52,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {540#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {518#false} is VALID [2022-04-27 13:39:52,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-04-27 13:39:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:39:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:39:52,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146996977] [2022-04-27 13:39:52,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146996977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:39:52,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:39:52,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:39:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124040816] [2022-04-27 13:39:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:39:52,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:39:52,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:39:52,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:39:52,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:52,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:39:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:39:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:39:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:39:52,959 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:39:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:53,306 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-27 13:39:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:39:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 13:39:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:39:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:39:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:39:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:39:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:39:53,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 13:39:53,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:53,369 INFO L225 Difference]: With dead ends: 50 [2022-04-27 13:39:53,370 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 13:39:53,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:39:53,375 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:39:53,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 48 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:39:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 13:39:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-27 13:39:53,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:39:53,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:53,390 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:53,393 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:53,397 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:39:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 13:39:53,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:53,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:53,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-27 13:39:53,398 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-27 13:39:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:53,400 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:39:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 13:39:53,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:53,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:53,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:39:53,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:39:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:39:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-27 13:39:53,402 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-27 13:39:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:39:53,403 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-27 13:39:53,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:39:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 13:39:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:39:53,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:39:53,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:39:53,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:39:53,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:39:53,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:39:53,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 1 times [2022-04-27 13:39:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:39:53,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079144612] [2022-04-27 13:39:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:39:53,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:39:53,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073578364] [2022-04-27 13:39:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:39:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:39:53,437 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 13:39:53,447 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 13:39:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:53,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:39:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:53,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:39:53,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-27 13:39:53,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-27 13:39:53,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:39:53,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #101#return; {781#true} is VALID [2022-04-27 13:39:53,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-27 13:39:53,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {781#true} is VALID [2022-04-27 13:39:53,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {781#true} is VALID [2022-04-27 13:39:53,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:39:53,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:39:53,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:39:53,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {781#true} {781#true} #81#return; {781#true} is VALID [2022-04-27 13:39:53,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-27 13:39:53,659 INFO L272 TraceCheckUtils]: 12: Hoare triple {781#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {781#true} is VALID [2022-04-27 13:39:53,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:39:53,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:39:53,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:39:53,659 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {781#true} {781#true} #83#return; {781#true} is VALID [2022-04-27 13:39:53,659 INFO L272 TraceCheckUtils]: 17: Hoare triple {781#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {781#true} is VALID [2022-04-27 13:39:53,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:39:53,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:39:53,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:39:53,660 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {781#true} {781#true} #85#return; {781#true} is VALID [2022-04-27 13:39:53,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:39:53,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:39:53,661 INFO L272 TraceCheckUtils]: 24: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {781#true} is VALID [2022-04-27 13:39:53,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:39:53,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:39:53,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:39:53,662 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {781#true} {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:39:53,662 INFO L272 TraceCheckUtils]: 29: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {781#true} is VALID [2022-04-27 13:39:53,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:39:53,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:39:53,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:39:53,663 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {781#true} {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:39:53,699 INFO L272 TraceCheckUtils]: 34: Hoare triple {852#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:39:53,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:39:53,700 INFO L290 TraceCheckUtils]: 36: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-27 13:39:53,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-27 13:39:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:39:53,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:39:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:39:53,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079144612] [2022-04-27 13:39:53,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:39:53,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073578364] [2022-04-27 13:39:53,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073578364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:39:53,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:39:53,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:39:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143912098] [2022-04-27 13:39:53,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:39:53,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-27 13:39:53,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:39:53,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:39:53,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:53,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:39:53,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:39:53,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:39:53,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:39:53,722 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:39:55,848 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 13:39:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:56,107 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-27 13:39:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:39:56,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-27 13:39:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:39:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:39:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:39:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:39:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:39:56,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 13:39:56,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:56,172 INFO L225 Difference]: With dead ends: 58 [2022-04-27 13:39:56,172 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 13:39:56,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:39:56,173 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:39:56,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 13:39:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 13:39:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 13:39:56,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:39:56,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:39:56,180 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:39:56,180 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:39:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:56,182 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 13:39:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:39:56,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:56,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:56,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-27 13:39:56,183 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-27 13:39:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:39:56,185 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 13:39:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:39:56,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:39:56,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:39:56,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:39:56,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:39:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 13:39:56,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-27 13:39:56,188 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-27 13:39:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:39:56,188 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-27 13:39:56,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 13:39:56,189 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:39:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 13:39:56,189 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:39:56,190 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:39:56,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:39:56,403 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 13:39:56,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:39:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:39:56,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 1 times [2022-04-27 13:39:56,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:39:56,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646988356] [2022-04-27 13:39:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:39:56,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:39:56,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302457524] [2022-04-27 13:39:56,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:39:56,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:39:56,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:39:56,417 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 13:39:56,418 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 13:39:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:39:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:39:56,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:39:57,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-27 13:39:57,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1179#true} is VALID [2022-04-27 13:39:57,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:57,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #101#return; {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret6 := main(); {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} #81#return; {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1179#true} is VALID [2022-04-27 13:39:57,867 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:57,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#true} ~cond := #in~cond; {1223#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:39:57,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1223#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1227#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:39:57,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1227#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:39:57,873 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1227#(not (= |assume_abort_if_not_#in~cond| 0))} {1179#true} #83#return; {1234#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-27 13:39:57,873 INFO L272 TraceCheckUtils]: 17: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 50)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:57,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:57,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:57,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:57,876 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1234#(<= (mod main_~B~0 4294967296) 50)} #85#return; {1234#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-27 13:39:57,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 50)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:39:57,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} assume !false; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:39:57,877 INFO L272 TraceCheckUtils]: 24: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:57,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:57,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:57,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:57,878 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} #87#return; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:39:57,878 INFO L272 TraceCheckUtils]: 29: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:57,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:57,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:57,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:57,878 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} #89#return; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:39:57,879 INFO L272 TraceCheckUtils]: 34: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:57,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:57,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:57,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:57,879 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} #91#return; {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:39:57,886 INFO L290 TraceCheckUtils]: 39: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:39:57,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} assume !false; {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:39:57,887 INFO L272 TraceCheckUtils]: 41: Hoare triple {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:39:57,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:39:57,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1180#false} is VALID [2022-04-27 13:39:57,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-27 13:39:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 13:39:57,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:39:58,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-27 13:39:58,401 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1180#false} is VALID [2022-04-27 13:39:58,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:39:58,402 INFO L272 TraceCheckUtils]: 41: Hoare triple {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:39:58,402 INFO L290 TraceCheckUtils]: 40: Hoare triple {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} assume !false; {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:39:58,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1332#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-27 13:39:58,404 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:39:58,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:58,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:58,404 INFO L272 TraceCheckUtils]: 34: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:58,406 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:39:58,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:58,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:58,406 INFO L272 TraceCheckUtils]: 29: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:58,407 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:39:58,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:58,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:58,407 INFO L272 TraceCheckUtils]: 24: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:58,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:39:58,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {1179#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1339#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:39:58,409 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1179#true} #85#return; {1179#true} is VALID [2022-04-27 13:39:58,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L272 TraceCheckUtils]: 17: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1179#true} {1179#true} #83#return; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} #81#return; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {1179#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret6 := main(); {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #101#return; {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-27 13:39:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 13:39:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:39:58,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646988356] [2022-04-27 13:39:58,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:39:58,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302457524] [2022-04-27 13:39:58,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302457524] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:39:58,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:39:58,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:39:58,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713339178] [2022-04-27 13:39:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:39:58,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-27 13:39:58,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:39:58,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:39:58,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:39:58,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:39:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:39:58,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:39:58,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:39:58,456 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:40:00,884 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 13:40:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:01,048 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-27 13:40:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:40:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-27 13:40:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:40:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:40:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 13:40:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:40:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 13:40:01,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 13:40:01,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:40:01,120 INFO L225 Difference]: With dead ends: 68 [2022-04-27 13:40:01,120 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 13:40:01,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:40:01,121 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 16 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:40:01,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:40:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 13:40:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 13:40:01,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:40:01,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:40:01,128 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:40:01,128 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:40:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:01,130 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 13:40:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 13:40:01,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:40:01,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:40:01,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 13:40:01,131 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-27 13:40:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:01,133 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 13:40:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 13:40:01,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:40:01,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:40:01,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:40:01,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:40:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 13:40:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-27 13:40:01,136 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-27 13:40:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:40:01,136 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-27 13:40:01,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 13:40:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-27 13:40:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:40:01,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:40:01,137 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:40:01,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:40:01,354 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 13:40:01,355 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:40:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:40:01,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 1 times [2022-04-27 13:40:01,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:40:01,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045402612] [2022-04-27 13:40:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:40:01,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:40:01,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:40:01,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769256188] [2022-04-27 13:40:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:40:01,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:40:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:40:01,368 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 13:40:01,368 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 13:40:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:40:01,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-27 13:40:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:40:01,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:40:03,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #101#return; {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret6 := main(); {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:03,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#true} #81#return; {1787#true} is VALID [2022-04-27 13:40:03,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1787#true} is VALID [2022-04-27 13:40:03,340 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#true} ~cond := #in~cond; {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:40:03,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:40:03,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:40:03,342 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} {1787#true} #83#return; {1842#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-27 13:40:03,342 INFO L272 TraceCheckUtils]: 17: Hoare triple {1842#(<= (mod main_~B~0 4294967296) 50)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#true} ~cond := #in~cond; {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:40:03,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {1831#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:40:03,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1835#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:40:03,344 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1835#(not (= |assume_abort_if_not_#in~cond| 0))} {1842#(<= (mod main_~B~0 4294967296) 50)} #85#return; {1858#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:40:03,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1858#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:40:03,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:40:03,345 INFO L272 TraceCheckUtils]: 24: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:03,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:03,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,345 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:40:03,345 INFO L272 TraceCheckUtils]: 29: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:03,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:03,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,346 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:40:03,346 INFO L272 TraceCheckUtils]: 34: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:03,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:03,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,348 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1787#true} {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #91#return; {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:40:03,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {1862#(and (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:40:03,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} assume !false; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:40:03,365 INFO L272 TraceCheckUtils]: 41: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:03,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:03,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,366 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} #87#return; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:40:03,366 INFO L272 TraceCheckUtils]: 46: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:03,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:03,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:03,366 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:03,368 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} #89#return; {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} is VALID [2022-04-27 13:40:03,372 INFO L272 TraceCheckUtils]: 51: Hoare triple {1914#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (<= (mod main_~B~0 4294967296) 50))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:40:03,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:40:03,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {1955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1788#false} is VALID [2022-04-27 13:40:03,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-27 13:40:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 13:40:03,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:40:04,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-27 13:40:04,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {1955#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1788#false} is VALID [2022-04-27 13:40:04,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1955#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:40:04,532 INFO L272 TraceCheckUtils]: 51: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1951#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:40:04,533 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #89#return; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:40:04,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:04,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:04,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:04,533 INFO L272 TraceCheckUtils]: 46: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:04,533 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #87#return; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:40:04,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:04,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:04,534 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:04,534 INFO L272 TraceCheckUtils]: 41: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:04,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:40:06,541 WARN L290 TraceCheckUtils]: 39: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1971#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 13:40:06,542 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1787#true} {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #91#return; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:40:06,542 INFO L290 TraceCheckUtils]: 37: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:06,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:06,542 INFO L272 TraceCheckUtils]: 34: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:06,542 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #89#return; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:40:06,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:06,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:06,543 INFO L272 TraceCheckUtils]: 29: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:06,544 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #87#return; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:40:06,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:06,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:06,545 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:06,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !false; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:40:06,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2008#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:40:06,545 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1787#true} {1787#true} #85#return; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L272 TraceCheckUtils]: 17: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#true} #81#return; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {1787#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret6 := main(); {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #101#return; {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {1787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-27 13:40:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:40:06,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:40:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045402612] [2022-04-27 13:40:06,548 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:40:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769256188] [2022-04-27 13:40:06,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769256188] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:40:06,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:40:06,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-27 13:40:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682744181] [2022-04-27 13:40:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:40:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-27 13:40:06,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:40:06,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:08,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:40:08,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:40:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:40:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:40:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:40:08,590 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:13,688 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 13:40:16,620 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 13:40:18,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:40:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:19,787 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-27 13:40:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:40:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-27 13:40:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:40:19,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 13:40:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:19,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 13:40:19,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-27 13:40:21,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:40:21,852 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:40:21,852 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 13:40:21,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:40:21,853 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:40:21,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-27 13:40:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 13:40:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-04-27 13:40:21,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:40:21,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:21,880 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:21,880 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:21,884 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 13:40:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-27 13:40:21,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:40:21,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:40:21,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 74 states. [2022-04-27 13:40:21,885 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 74 states. [2022-04-27 13:40:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:21,887 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-27 13:40:21,888 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-27 13:40:21,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:40:21,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:40:21,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:40:21,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:40:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2022-04-27 13:40:21,893 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 55 [2022-04-27 13:40:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:40:21,894 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2022-04-27 13:40:21,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2022-04-27 13:40:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 13:40:21,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:40:21,899 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:40:21,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 13:40:22,099 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 13:40:22,099 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:40:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:40:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 1 times [2022-04-27 13:40:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:40:22,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084594169] [2022-04-27 13:40:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:40:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:40:22,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:40:22,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811285217] [2022-04-27 13:40:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:40:22,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:40:22,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:40:22,114 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 13:40:22,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:40:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:40:22,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:40:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:40:22,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:40:24,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {2493#true} call ULTIMATE.init(); {2493#true} is VALID [2022-04-27 13:40:24,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2493#true} is VALID [2022-04-27 13:40:24,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2493#true} {2493#true} #101#return; {2493#true} is VALID [2022-04-27 13:40:24,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {2493#true} call #t~ret6 := main(); {2493#true} is VALID [2022-04-27 13:40:24,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {2493#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2493#true} is VALID [2022-04-27 13:40:24,618 INFO L272 TraceCheckUtils]: 6: Hoare triple {2493#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2493#true} {2493#true} #81#return; {2493#true} is VALID [2022-04-27 13:40:24,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {2493#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2493#true} is VALID [2022-04-27 13:40:24,619 INFO L272 TraceCheckUtils]: 12: Hoare triple {2493#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {2493#true} ~cond := #in~cond; {2537#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:40:24,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2541#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:40:24,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {2541#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2541#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:40:24,628 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2541#(not (= |assume_abort_if_not_#in~cond| 0))} {2493#true} #83#return; {2548#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-27 13:40:24,628 INFO L272 TraceCheckUtils]: 17: Hoare triple {2548#(<= (mod main_~B~0 4294967296) 50)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,628 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2493#true} {2548#(<= (mod main_~B~0 4294967296) 50)} #85#return; {2548#(<= (mod main_~B~0 4294967296) 50)} is VALID [2022-04-27 13:40:24,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#(<= (mod main_~B~0 4294967296) 50)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,629 INFO L272 TraceCheckUtils]: 24: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,630 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2493#true} {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #87#return; {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,630 INFO L272 TraceCheckUtils]: 29: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,637 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2493#true} {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #89#return; {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,637 INFO L272 TraceCheckUtils]: 34: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,638 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2493#true} {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #91#return; {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {2567#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,639 INFO L272 TraceCheckUtils]: 41: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2493#true} {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #93#return; {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,640 INFO L272 TraceCheckUtils]: 46: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:24,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:24,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:24,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:24,640 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2493#true} {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #95#return; {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,641 INFO L290 TraceCheckUtils]: 51: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !(1 != ~p~0 % 4294967296); {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:40:24,641 INFO L272 TraceCheckUtils]: 52: Hoare triple {2619#(and (<= (mod main_~d~0 4294967296) 50) (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:40:24,642 INFO L290 TraceCheckUtils]: 53: Hoare triple {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:40:24,642 INFO L290 TraceCheckUtils]: 54: Hoare triple {2663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2494#false} is VALID [2022-04-27 13:40:24,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {2494#false} assume !false; {2494#false} is VALID [2022-04-27 13:40:24,643 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-27 13:40:24,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:40:25,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {2494#false} assume !false; {2494#false} is VALID [2022-04-27 13:40:25,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {2663#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2494#false} is VALID [2022-04-27 13:40:25,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2663#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:40:25,907 INFO L272 TraceCheckUtils]: 52: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2659#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:40:25,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !(1 != ~p~0 % 4294967296); {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:40:25,908 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2493#true} {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #95#return; {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:40:25,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,908 INFO L272 TraceCheckUtils]: 46: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,910 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2493#true} {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #93#return; {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:40:25,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,910 INFO L272 TraceCheckUtils]: 41: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !false; {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:40:25,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2679#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:40:25,911 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2493#true} {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:40:25,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,912 INFO L272 TraceCheckUtils]: 34: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,913 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2493#true} {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:40:25,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,913 INFO L272 TraceCheckUtils]: 29: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,916 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2493#true} {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:40:25,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,917 INFO L272 TraceCheckUtils]: 24: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {2493#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2719#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 13:40:25,918 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2493#true} {2493#true} #85#return; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L272 TraceCheckUtils]: 17: Hoare triple {2493#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2493#true} {2493#true} #83#return; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {2493#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 50 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {2493#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2493#true} is VALID [2022-04-27 13:40:25,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2493#true} {2493#true} #81#return; {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {2493#true} assume !(0 == ~cond); {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {2493#true} ~cond := #in~cond; {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {2493#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 50 then 1 else 0)); {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {2493#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {2493#true} call #t~ret6 := main(); {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2493#true} {2493#true} #101#return; {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {2493#true} assume true; {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {2493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {2493#true} call ULTIMATE.init(); {2493#true} is VALID [2022-04-27 13:40:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 13:40:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:40:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084594169] [2022-04-27 13:40:25,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:40:25,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811285217] [2022-04-27 13:40:25,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811285217] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:40:25,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:40:25,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:40:25,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063377725] [2022-04-27 13:40:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:40:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-27 13:40:25,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:40:25,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:25,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:40:25,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:40:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:40:25,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:40:25,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:40:25,966 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:31,633 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2022-04-27 13:40:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:40:31,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-27 13:40:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:40:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:40:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:40:31,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:40:31,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:40:31,712 INFO L225 Difference]: With dead ends: 77 [2022-04-27 13:40:31,712 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 13:40:31,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:40:31,713 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:40:31,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:40:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 13:40:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-27 13:40:31,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:40:31,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:31,721 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:31,721 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:31,723 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-27 13:40:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 13:40:31,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:40:31,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:40:31,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-27 13:40:31,724 INFO L87 Difference]: Start difference. First operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 70 states. [2022-04-27 13:40:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:40:31,725 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-27 13:40:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 13:40:31,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:40:31,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:40:31,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:40:31,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:40:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 21 states have call successors, (21), 9 states have call predecessors, (21), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-27 13:40:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2022-04-27 13:40:31,728 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 56 [2022-04-27 13:40:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:40:31,728 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2022-04-27 13:40:31,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:40:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2022-04-27 13:40:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 13:40:31,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:40:31,729 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:40:31,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:40:31,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:40:31,946 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:40:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:40:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 1 times [2022-04-27 13:40:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:40:31,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577110784] [2022-04-27 13:40:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:40:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:40:31,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:40:31,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539131300] [2022-04-27 13:40:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:40:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:40:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:40:31,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:40:31,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process