/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_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:36:53,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:36:53,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:36:53,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:36:53,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:36:53,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:36:53,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:36:53,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:36:53,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:36:53,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:36:53,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:36:53,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:36:53,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:36:53,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:36:53,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:36:53,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:36:53,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:36:53,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:36:53,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:36:53,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:36:53,202 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:36:53,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:36:53,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:36:53,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:36:53,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:36:53,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:36:53,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:36:53,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:36:53,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:36:53,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:36:53,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:36:53,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:36:53,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:36:53,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:36:53,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:36:53,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:36:53,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:36:53,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:36:53,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:36:53,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:36:53,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:36:53,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:36:53,228 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:36:53,243 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:36:53,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:36:53,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:36:53,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:36:53,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:36:53,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:36:53,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:36:53,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:36:53,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:36:53,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:36:53,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:36:53,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:36:53,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:36:53,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:36:53,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:36:53,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:36:53,249 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:36:53,249 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:36:53,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:36:53,249 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:36:53,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:36:53,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:36:53,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:36:53,405 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:36:53,419 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:36:53,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c [2022-04-27 13:36:53,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10c85e44/a0872170f1034e93ae08ebdd17a4396b/FLAG3332e34f2 [2022-04-27 13:36:53,790 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:36:53,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound1.c [2022-04-27 13:36:53,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10c85e44/a0872170f1034e93ae08ebdd17a4396b/FLAG3332e34f2 [2022-04-27 13:36:54,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10c85e44/a0872170f1034e93ae08ebdd17a4396b [2022-04-27 13:36:54,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:36:54,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:36:54,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:36:54,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:36:54,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:36:54,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427e3d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54, skipping insertion in model container [2022-04-27 13:36:54,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:36:54,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:36:54,418 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_valuebound1.c[537,550] [2022-04-27 13:36:54,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:36:54,437 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:36:54,444 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_valuebound1.c[537,550] [2022-04-27 13:36:54,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:36:54,457 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:36:54,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54 WrapperNode [2022-04-27 13:36:54,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:36:54,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:36:54,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:36:54,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:36:54,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:36:54,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:36:54,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:36:54,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:36:54,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (1/1) ... [2022-04-27 13:36:54,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:36:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:54,504 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:36:54,511 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:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:36:54,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:36:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:36:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:36:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:36:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:36:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:36:54,576 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:36:54,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:36:54,684 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:36:54,688 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:36:54,689 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:36:54,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:36:54 BoogieIcfgContainer [2022-04-27 13:36:54,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:36:54,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:36:54,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:36:54,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:36:54,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:36:54" (1/3) ... [2022-04-27 13:36:54,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1868f197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:36:54, skipping insertion in model container [2022-04-27 13:36:54,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:54" (2/3) ... [2022-04-27 13:36:54,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1868f197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:36:54, skipping insertion in model container [2022-04-27 13:36:54,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:36:54" (3/3) ... [2022-04-27 13:36:54,695 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2022-04-27 13:36:54,704 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:36:54,704 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:36:54,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:36:54,746 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@4da71cef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c317b4b [2022-04-27 13:36:54,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:36:54,763 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:36:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:36:54,781 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:54,781 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:36:54,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:54,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 1 times [2022-04-27 13:36:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:54,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792853841] [2022-04-27 13:36:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,910 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:36:54,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 13:36:54,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-27 13:36:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:36:54,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:36:54,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:36:54,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 13:36:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:36:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:36:54,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:36:54,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:36:54,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 13:36:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:36:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:36:54,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:36:54,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:36:54,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-27 13:36:54,932 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:36:54,932 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:36:54,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 13:36:54,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-27 13:36:54,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret6 := main(); {41#true} is VALID [2022-04-27 13:36:54,933 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:36:54,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {41#true} is VALID [2022-04-27 13:36:54,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:36:54,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:36:54,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:36:54,934 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 13:36:54,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~B~0 := #t~nondet5;havoc #t~nondet5; {42#false} is VALID [2022-04-27 13:36:54,934 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {41#true} is VALID [2022-04-27 13:36:54,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:36:54,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:36:54,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:36:54,935 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 13:36:54,935 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:36:54,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 13:36:54,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 13:36:54,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 13:36:54,936 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-27 13:36:54,936 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:36:54,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 13:36:54,937 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:36:54,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 13:36:54,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 13:36:54,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 13:36:54,937 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:36:54,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:54,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792853841] [2022-04-27 13:36:54,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792853841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:54,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:54,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:36:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672633401] [2022-04-27 13:36:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:54,944 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:36:54,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:54,947 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:36:54,967 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:36:54,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:36:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:36:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:36:54,983 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:36:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,118 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-04-27 13:36:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:36:55,119 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:36:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:55,120 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:36:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 13:36:55,134 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:36:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-27 13:36:55,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-27 13:36:55,267 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:36:55,279 INFO L225 Difference]: With dead ends: 69 [2022-04-27 13:36:55,280 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:36:55,282 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:36:55,286 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:36:55,288 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:36:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:36:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 13:36:55,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:55,330 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:36:55,331 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:36:55,331 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:36:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,335 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:36:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:55,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,336 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:36:55,336 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:36:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,339 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:36:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:55,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:55,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:55,340 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:36:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-27 13:36:55,343 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-27 13:36:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:55,346 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-27 13:36:55,347 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:36:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:36:55,349 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:55,349 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:36:55,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:36:55,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 1 times [2022-04-27 13:36:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:55,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353184171] [2022-04-27 13:36:55,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:55,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,465 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:36:55,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #101#return; {275#true} is VALID [2022-04-27 13:36:55,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:36:55,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:36:55,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #81#return; {275#true} is VALID [2022-04-27 13:36:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:36:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:36:55,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:36:55,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 13:36:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:36:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:36:55,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:36:55,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #85#return; {275#true} is VALID [2022-04-27 13:36:55,494 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:36:55,494 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:36:55,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #101#return; {275#true} is VALID [2022-04-27 13:36:55,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret6 := main(); {275#true} is VALID [2022-04-27 13:36:55,495 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:36:55,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {275#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {275#true} is VALID [2022-04-27 13:36:55,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:36:55,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:36:55,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,495 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {275#true} {275#true} #81#return; {275#true} is VALID [2022-04-27 13:36:55,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {275#true} is VALID [2022-04-27 13:36:55,496 INFO L272 TraceCheckUtils]: 12: Hoare triple {275#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {275#true} is VALID [2022-04-27 13:36:55,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:36:55,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:36:55,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,496 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 13:36:55,496 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:36:55,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 13:36:55,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 13:36:55,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 13:36:55,497 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {275#true} {275#true} #85#return; {275#true} is VALID [2022-04-27 13:36:55,497 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:36:55,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {292#(= main_~q~0 0)} assume !false; {292#(= main_~q~0 0)} is VALID [2022-04-27 13:36:55,498 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:36:55,498 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:36:55,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {294#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {276#false} is VALID [2022-04-27 13:36:55,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 13:36:55,499 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:36:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:55,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353184171] [2022-04-27 13:36:55,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353184171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:55,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:55,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565369887] [2022-04-27 13:36:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:55,501 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:36:55,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:55,501 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:36:55,518 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:36:55,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:55,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:55,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:55,519 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:36:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,903 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-27 13:36:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:36:55,903 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:36:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:55,904 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:36:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:36:55,910 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:36:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:36:55,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 13:36:55,967 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:36:55,971 INFO L225 Difference]: With dead ends: 46 [2022-04-27 13:36:55,971 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:36:55,976 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:36:55,977 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:36:55,977 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:36:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:36:55,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-27 13:36:55,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:55,983 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:36:55,983 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:36:55,983 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:36:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,985 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:36:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:36:55,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,986 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:36:55,987 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:36:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,989 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-27 13:36:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-27 13:36:55,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:55,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:55,990 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:36:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-27 13:36:55,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-27 13:36:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:55,992 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-27 13:36:55,992 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:36:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-27 13:36:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 13:36:55,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:55,993 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:36:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:36:55,993 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 1 times [2022-04-27 13:36:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880103500] [2022-04-27 13:36:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,103 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:36:56,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {517#true} {517#true} #101#return; {517#true} is VALID [2022-04-27 13:36:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #81#return; {517#true} is VALID [2022-04-27 13:36:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 13:36:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #83#return; {517#true} is VALID [2022-04-27 13:36:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 13:36:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #85#return; {517#true} is VALID [2022-04-27 13:36:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 13:36:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,124 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:36:56,125 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:36:56,125 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:36:56,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {517#true} {517#true} #101#return; {517#true} is VALID [2022-04-27 13:36:56,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {517#true} call #t~ret6 := main(); {517#true} is VALID [2022-04-27 13:36:56,125 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:36:56,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {517#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {517#true} is VALID [2022-04-27 13:36:56,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {517#true} {517#true} #81#return; {517#true} is VALID [2022-04-27 13:36:56,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {517#true} is VALID [2022-04-27 13:36:56,126 INFO L272 TraceCheckUtils]: 12: Hoare triple {517#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {517#true} is VALID [2022-04-27 13:36:56,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,126 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {517#true} {517#true} #83#return; {517#true} is VALID [2022-04-27 13:36:56,126 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:36:56,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,127 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {517#true} {517#true} #85#return; {517#true} is VALID [2022-04-27 13:36:56,127 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:36:56,127 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:36:56,127 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:36:56,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {517#true} ~cond := #in~cond; {517#true} is VALID [2022-04-27 13:36:56,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {517#true} assume !(0 == ~cond); {517#true} is VALID [2022-04-27 13:36:56,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {517#true} assume true; {517#true} is VALID [2022-04-27 13:36:56,128 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:36:56,129 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:36:56,129 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:36:56,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {540#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {518#false} is VALID [2022-04-27 13:36:56,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-04-27 13:36:56,130 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:36:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:56,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880103500] [2022-04-27 13:36:56,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880103500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:56,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:56,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932573772] [2022-04-27 13:36:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:56,131 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:36:56,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:56,131 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:36:56,147 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:36:56,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:56,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:56,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:56,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:56,148 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:36:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:56,534 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-27 13:36:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:36:56,535 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:36:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:56,535 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:36:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:36:56,536 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:36:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 13:36:56,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 13:36:56,590 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:36:56,592 INFO L225 Difference]: With dead ends: 50 [2022-04-27 13:36:56,592 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 13:36:56,592 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:36:56,593 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:56,593 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.2s Time] [2022-04-27 13:36:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 13:36:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-27 13:36:56,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:56,597 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:36:56,598 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:36:56,598 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:36:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:56,600 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:36:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 13:36:56,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:56,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:56,601 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:36:56,602 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:36:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:56,603 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-27 13:36:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-27 13:36:56,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:56,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:56,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:56,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:56,605 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:36:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-27 13:36:56,606 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-27 13:36:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:56,606 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-27 13:36:56,606 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:36:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-27 13:36:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:36:56,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:56,607 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:36:56,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 13:36:56,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 1 times [2022-04-27 13:36:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:56,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228786174] [2022-04-27 13:36:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:56,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:56,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [881794604] [2022-04-27 13:36:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:56,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:56,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:56,622 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:36:56,622 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:36:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:36:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:56,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-27 13:36:56,948 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:36:56,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:36:56,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #101#return; {781#true} is VALID [2022-04-27 13:36:56,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-27 13:36:56,949 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:36:56,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {781#true} is VALID [2022-04-27 13:36:56,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:36:56,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:36:56,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:36:56,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {781#true} {781#true} #81#return; {781#true} is VALID [2022-04-27 13:36:56,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-27 13:36:56,949 INFO L272 TraceCheckUtils]: 12: Hoare triple {781#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {781#true} is VALID [2022-04-27 13:36:56,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:36:56,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:36:56,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:36:56,950 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {781#true} {781#true} #83#return; {781#true} is VALID [2022-04-27 13:36:56,950 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:36:56,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:36:56,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:36:56,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:36:56,950 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {781#true} {781#true} #85#return; {781#true} is VALID [2022-04-27 13:36:56,954 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:36:56,955 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:36:56,955 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:36:56,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:36:56,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:36:56,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:36:56,957 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:36:56,957 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:36:56,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-27 13:36:56,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-27 13:36:56,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-27 13:36:56,968 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:36:56,968 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:36:56,969 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:36:56,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-27 13:36:56,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-27 13:36:56,969 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:36:56,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:56,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228786174] [2022-04-27 13:36:56,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:56,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881794604] [2022-04-27 13:36:56,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881794604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:56,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:36:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710434989] [2022-04-27 13:36:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:56,971 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:36:56,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:56,971 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:36:56,989 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:36:56,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:36:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:56,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:36:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:36:56,990 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:36:59,122 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:36:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:59,335 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-27 13:36:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:36:59,336 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:36:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:59,336 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:36:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:36:59,338 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:36:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 13:36:59,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 13:36:59,393 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:36:59,395 INFO L225 Difference]: With dead ends: 58 [2022-04-27 13:36:59,395 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 13:36:59,395 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:36:59,396 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:59,396 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.0s Time] [2022-04-27 13:36:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 13:36:59,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 13:36:59,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:59,402 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:36:59,402 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:36:59,402 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:36:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:59,404 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 13:36:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:36:59,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:59,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:59,405 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:36:59,406 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:36:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:59,408 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-27 13:36:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:36:59,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:59,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:59,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:59,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:59,409 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:36:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-27 13:36:59,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-27 13:36:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:59,410 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-27 13:36:59,411 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:36:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-27 13:36:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 13:36:59,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:59,411 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:36:59,445 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:36:59,628 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:36:59,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:59,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 1 times [2022-04-27 13:36:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:59,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292699287] [2022-04-27 13:36:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:59,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:59,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318964177] [2022-04-27 13:36:59,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:59,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:59,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:59,666 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:36:59,667 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:36:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:59,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:36:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:59,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:00,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-27 13:37:00,864 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:37:00,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:00,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #101#return; {1179#true} is VALID [2022-04-27 13:37:00,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret6 := main(); {1179#true} is VALID [2022-04-27 13:37:00,864 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:37:00,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:00,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:00,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:00,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:00,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} #81#return; {1179#true} is VALID [2022-04-27 13:37:00,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1179#true} is VALID [2022-04-27 13:37:00,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:00,870 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:37:00,871 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:37:00,871 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:37:00,871 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) 1)} is VALID [2022-04-27 13:37:00,872 INFO L272 TraceCheckUtils]: 17: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:00,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:00,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:00,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:00,872 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1234#(<= (mod main_~B~0 4294967296) 1)} #85#return; {1234#(<= (mod main_~B~0 4294967296) 1)} is VALID [2022-04-27 13:37:00,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {1234#(<= (mod main_~B~0 4294967296) 1)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:00,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !false; {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:00,873 INFO L272 TraceCheckUtils]: 24: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= 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:37:00,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:00,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:00,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:00,874 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #87#return; {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:00,874 INFO L272 TraceCheckUtils]: 29: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= 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:37:00,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:00,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:00,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:00,875 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #89#return; {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:00,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= 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:37:00,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:00,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:00,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:00,876 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1179#true} {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #91#return; {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:00,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {1253#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0) (= 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))) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:00,877 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))) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0))} assume !false; {1305#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:00,877 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))) (<= (mod main_~B~0 4294967296) 1) (= main_~q~0 0))} 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:37:00,878 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:37:00,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1180#false} is VALID [2022-04-27 13:37:00,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-27 13:37:00,878 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:37:00,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:01,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2022-04-27 13:37:01,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {1316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1180#false} is VALID [2022-04-27 13:37:01,269 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:37:01,270 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:37:01,271 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:37:01,272 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:37:01,272 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:37:01,272 INFO L290 TraceCheckUtils]: 37: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,272 INFO L290 TraceCheckUtils]: 36: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:01,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:01,273 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:37:01,273 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:37:01,274 INFO L290 TraceCheckUtils]: 32: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:01,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:01,274 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:37:01,274 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:37:01,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:01,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:01,275 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:37:01,275 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:37:01,275 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:37:01,276 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1179#true} {1179#true} #85#return; {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:01,276 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:37:01,276 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1179#true} {1179#true} #83#return; {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {1179#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {1179#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1179#true} is VALID [2022-04-27 13:37:01,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1179#true} {1179#true} #81#return; {1179#true} is VALID [2022-04-27 13:37:01,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {1179#true} assume !(0 == ~cond); {1179#true} is VALID [2022-04-27 13:37:01,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#true} ~cond := #in~cond; {1179#true} is VALID [2022-04-27 13:37:01,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {1179#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1179#true} is VALID [2022-04-27 13:37:01,277 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:37:01,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {1179#true} call #t~ret6 := main(); {1179#true} is VALID [2022-04-27 13:37:01,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1179#true} {1179#true} #101#return; {1179#true} is VALID [2022-04-27 13:37:01,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {1179#true} assume true; {1179#true} is VALID [2022-04-27 13:37:01,277 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:37:01,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1179#true} is VALID [2022-04-27 13:37:01,277 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:37:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:01,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292699287] [2022-04-27 13:37:01,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:01,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318964177] [2022-04-27 13:37:01,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318964177] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:37:01,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:37:01,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:37:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033453083] [2022-04-27 13:37:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:01,278 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:37:01,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:01,279 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:37:01,305 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:37:01,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:37:01,306 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:37:03,572 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:37:03,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:03,720 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-27 13:37:03,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:03,720 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:37:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:03,721 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:37:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 13:37:03,722 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:37:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-27 13:37:03,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-27 13:37:03,775 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:37:03,776 INFO L225 Difference]: With dead ends: 68 [2022-04-27 13:37:03,776 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 13:37:03,777 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:37:03,777 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:37:03,778 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:37:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 13:37:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 13:37:03,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:03,785 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:37:03,785 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:37:03,785 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:37:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:03,787 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 13:37:03,787 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 13:37:03,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:03,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:03,788 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:37:03,788 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:37:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:03,790 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 13:37:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-27 13:37:03,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:03,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:03,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:03,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:03,791 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:37:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-27 13:37:03,793 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-27 13:37:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:03,793 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-27 13:37:03,793 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:37:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-27 13:37:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:37:03,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:03,794 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:37:03,829 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:37:04,007 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:37:04,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 1 times [2022-04-27 13:37:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:04,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668569346] [2022-04-27 13:37:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:04,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:04,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876106082] [2022-04-27 13:37:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:04,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:04,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:04,063 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:37:04,066 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:37:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:04,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:37:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:04,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:04,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-27 13:37:04,431 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:37:04,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #101#return; {1787#true} is VALID [2022-04-27 13:37:04,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret6 := main(); {1787#true} is VALID [2022-04-27 13:37:04,431 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:37:04,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#true} #81#return; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-27 13:37:04,432 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:37:04,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,432 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1787#true} {1787#true} #85#return; {1787#true} is VALID [2022-04-27 13:37:04,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1858#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:04,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {1858#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1858#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:04,433 INFO L272 TraceCheckUtils]: 24: Hoare triple {1858#(and (= main_~A~0 main_~r~0) (= 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:37:04,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:04,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:04,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,434 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {1858#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {1858#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:04,434 INFO L272 TraceCheckUtils]: 29: Hoare triple {1858#(and (= main_~A~0 main_~r~0) (= 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:37:04,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#true} ~cond := #in~cond; {1883#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:04,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {1883#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:04,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:04,437 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} {1858#(and (= main_~A~0 main_~r~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {1894#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:04,437 INFO L272 TraceCheckUtils]: 34: Hoare triple {1894#(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)); {1787#true} is VALID [2022-04-27 13:37:04,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#true} ~cond := #in~cond; {1883#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:04,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {1883#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:04,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:04,438 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} {1894#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #91#return; {1894#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:04,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {1894#(and (= 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; {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 13:37:04,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !false; {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 13:37:04,440 INFO L272 TraceCheckUtils]: 41: Hoare triple {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:04,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:04,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:04,440 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,441 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #87#return; {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 13:37:04,441 INFO L272 TraceCheckUtils]: 46: Hoare triple {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:04,441 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:04,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:04,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:04,442 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #89#return; {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 13:37:04,443 INFO L272 TraceCheckUtils]: 51: Hoare triple {1913#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:04,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:04,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {1954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1788#false} is VALID [2022-04-27 13:37:04,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-27 13:37:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-27 13:37:04,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:05,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {1788#false} assume !false; {1788#false} is VALID [2022-04-27 13:37:05,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {1954#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1788#false} is VALID [2022-04-27 13:37:05,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1954#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:05,722 INFO L272 TraceCheckUtils]: 51: Hoare triple {1970#(= (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)); {1950#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:05,723 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1787#true} {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #89#return; {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:05,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:05,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:05,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:05,723 INFO L272 TraceCheckUtils]: 46: Hoare triple {1970#(= (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:37:05,723 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1787#true} {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #87#return; {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:05,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:05,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:05,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:05,724 INFO L272 TraceCheckUtils]: 41: Hoare triple {1970#(= (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:37:05,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:06,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {2007#(= (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; {1970#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:06,898 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} {1787#true} #91#return; {2007#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:06,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:06,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {2020#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1887#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:37:06,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {1787#true} ~cond := #in~cond; {2020#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:37:06,899 INFO L272 TraceCheckUtils]: 34: Hoare triple {1787#true} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:06,899 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1787#true} {1787#true} #89#return; {1787#true} is VALID [2022-04-27 13:37:06,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L272 TraceCheckUtils]: 29: Hoare triple {1787#true} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1787#true} {1787#true} #87#return; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L272 TraceCheckUtils]: 24: Hoare triple {1787#true} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {1787#true} assume !false; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {1787#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1787#true} {1787#true} #85#return; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:06,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:06,900 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:37:06,901 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1787#true} {1787#true} #83#return; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L272 TraceCheckUtils]: 12: Hoare triple {1787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1787#true} {1787#true} #81#return; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#true} assume !(0 == ~cond); {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#true} ~cond := #in~cond; {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L272 TraceCheckUtils]: 6: Hoare triple {1787#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1787#true} is VALID [2022-04-27 13:37:06,901 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:37:06,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1787#true} call #t~ret6 := main(); {1787#true} is VALID [2022-04-27 13:37:06,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1787#true} {1787#true} #101#return; {1787#true} is VALID [2022-04-27 13:37:06,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1787#true} assume true; {1787#true} is VALID [2022-04-27 13:37:06,902 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:37:06,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {1787#true} call ULTIMATE.init(); {1787#true} is VALID [2022-04-27 13:37:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:37:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668569346] [2022-04-27 13:37:06,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876106082] [2022-04-27 13:37:06,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876106082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:37:06,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:37:06,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-27 13:37:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300834168] [2022-04-27 13:37:06,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:37:06,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 55 [2022-04-27 13:37:06,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:06,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:37:08,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:08,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:37:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:37:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:08,419 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:37:17,554 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:37:22,351 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:37:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:24,287 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2022-04-27 13:37:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 13:37:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 55 [2022-04-27 13:37:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:37:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-04-27 13:37:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:37:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 93 transitions. [2022-04-27 13:37:24,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 93 transitions. [2022-04-27 13:37:29,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 91 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:29,199 INFO L225 Difference]: With dead ends: 92 [2022-04-27 13:37:29,199 INFO L226 Difference]: Without dead ends: 84 [2022-04-27 13:37:29,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:37:29,200 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 36 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:29,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 140 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2022-04-27 13:37:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-27 13:37:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-27 13:37:29,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:29,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:29,226 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:29,226 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:29,229 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-27 13:37:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-27 13:37:29,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:29,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:29,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-27 13:37:29,230 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-27 13:37:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:29,232 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-27 13:37:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-27 13:37:29,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:29,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:29,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:29,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 50 states have internal predecessors, (56), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-27 13:37:29,235 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 55 [2022-04-27 13:37:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:29,235 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-27 13:37:29,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 9 states have internal predecessors, (26), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-27 13:37:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-27 13:37:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 13:37:29,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:29,236 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:37:29,241 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:37:29,440 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:37:29,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 1 times [2022-04-27 13:37:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:29,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816130704] [2022-04-27 13:37:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:29,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:29,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:29,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517470098] [2022-04-27 13:37:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:29,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:29,453 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:37:29,454 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:37:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:29,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 13:37:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:29,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:31,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {2559#true} call ULTIMATE.init(); {2559#true} is VALID [2022-04-27 13:37:31,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {2559#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); {2559#true} is VALID [2022-04-27 13:37:31,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2559#true} {2559#true} #101#return; {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {2559#true} call #t~ret6 := main(); {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {2559#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; {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {2559#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2559#true} {2559#true} #81#return; {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2559#true} is VALID [2022-04-27 13:37:31,331 INFO L272 TraceCheckUtils]: 12: Hoare triple {2559#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:31,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#true} ~cond := #in~cond; {2603#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:37:31,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {2603#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2607#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:31,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {2607#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2607#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:31,335 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2607#(not (= |assume_abort_if_not_#in~cond| 0))} {2559#true} #83#return; {2614#(<= (mod main_~B~0 4294967296) 1)} is VALID [2022-04-27 13:37:31,335 INFO L272 TraceCheckUtils]: 17: Hoare triple {2614#(<= (mod main_~B~0 4294967296) 1)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:31,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,336 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2559#true} {2614#(<= (mod main_~B~0 4294967296) 1)} #85#return; {2614#(<= (mod main_~B~0 4294967296) 1)} is VALID [2022-04-27 13:37:31,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {2614#(<= (mod main_~B~0 4294967296) 1)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} assume !false; {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,337 INFO L272 TraceCheckUtils]: 24: Hoare triple {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2559#true} {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} #87#return; {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,337 INFO L272 TraceCheckUtils]: 29: Hoare triple {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,338 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2559#true} {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} #89#return; {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,338 INFO L272 TraceCheckUtils]: 34: Hoare triple {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:31,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,345 INFO L290 TraceCheckUtils]: 37: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,345 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2559#true} {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} #91#return; {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {2633#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,346 INFO L290 TraceCheckUtils]: 40: Hoare triple {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,346 INFO L272 TraceCheckUtils]: 41: Hoare triple {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (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)); {2559#true} is VALID [2022-04-27 13:37:31,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,347 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2559#true} {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #93#return; {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,347 INFO L272 TraceCheckUtils]: 46: Hoare triple {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (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)); {2559#true} is VALID [2022-04-27 13:37:31,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:31,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:31,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:31,348 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2559#true} {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #95#return; {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !(1 != ~p~0 % 4294967296); {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:31,349 INFO L272 TraceCheckUtils]: 52: Hoare triple {2685#(and (= main_~A~0 main_~r~0) (<= (mod main_~d~0 4294967296) 1) (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)); {2725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:31,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {2725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:31,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2560#false} is VALID [2022-04-27 13:37:31,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {2560#false} assume !false; {2560#false} is VALID [2022-04-27 13:37:31,350 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:37:31,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:32,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {2560#false} assume !false; {2560#false} is VALID [2022-04-27 13:37:32,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {2729#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2560#false} is VALID [2022-04-27 13:37:32,808 INFO L290 TraceCheckUtils]: 53: Hoare triple {2725#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2729#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:32,809 INFO L272 TraceCheckUtils]: 52: Hoare triple {2745#(= (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)); {2725#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:32,809 INFO L290 TraceCheckUtils]: 51: Hoare triple {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !(1 != ~p~0 % 4294967296); {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:32,809 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2559#true} {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #95#return; {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:32,809 INFO L290 TraceCheckUtils]: 49: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,809 INFO L290 TraceCheckUtils]: 48: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L272 TraceCheckUtils]: 46: Hoare triple {2745#(= (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)); {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2559#true} {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #93#return; {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:32,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L272 TraceCheckUtils]: 41: Hoare triple {2745#(= (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)); {2559#true} is VALID [2022-04-27 13:37:32,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !false; {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:32,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {2785#(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); {2745#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-27 13:37:32,811 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2559#true} {2785#(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; {2785#(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:37:32,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,812 INFO L272 TraceCheckUtils]: 34: Hoare triple {2785#(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)); {2559#true} is VALID [2022-04-27 13:37:32,812 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2559#true} {2785#(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; {2785#(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:37:32,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,812 INFO L272 TraceCheckUtils]: 29: Hoare triple {2785#(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)); {2559#true} is VALID [2022-04-27 13:37:32,814 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2559#true} {2785#(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; {2785#(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:37:32,814 INFO L290 TraceCheckUtils]: 27: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,814 INFO L272 TraceCheckUtils]: 24: Hoare triple {2785#(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)); {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {2785#(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; {2785#(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:37:32,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {2559#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2785#(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:37:32,815 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2559#true} {2559#true} #85#return; {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L272 TraceCheckUtils]: 17: Hoare triple {2559#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2559#true} {2559#true} #83#return; {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L272 TraceCheckUtils]: 12: Hoare triple {2559#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2559#true} {2559#true} #81#return; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {2559#true} assume !(0 == ~cond); {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {2559#true} ~cond := #in~cond; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L272 TraceCheckUtils]: 6: Hoare triple {2559#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {2559#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; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {2559#true} call #t~ret6 := main(); {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2559#true} {2559#true} #101#return; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {2559#true} assume true; {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {2559#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); {2559#true} is VALID [2022-04-27 13:37:32,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {2559#true} call ULTIMATE.init(); {2559#true} is VALID [2022-04-27 13:37:32,816 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:37:32,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:32,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816130704] [2022-04-27 13:37:32,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:32,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517470098] [2022-04-27 13:37:32,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517470098] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:37:32,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:37:32,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:37:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804546152] [2022-04-27 13:37:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:32,817 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:37:32,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:32,818 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:37:32,852 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:37:32,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:32,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:32,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:37:32,852 INFO L87 Difference]: Start difference. First operand 84 states and 107 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:37:36,652 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:37:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:41,610 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-04-27 13:37:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:41,610 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:37:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:41,611 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:37:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:37:41,612 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:37:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:37:41,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:37:41,685 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:37:41,686 INFO L225 Difference]: With dead ends: 90 [2022-04-27 13:37:41,686 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 13:37:41,687 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:37:41,687 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:41,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-27 13:37:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 13:37:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-04-27 13:37:41,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:41,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:41,720 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:41,721 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:41,723 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-27 13:37:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-27 13:37:41,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:41,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:41,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 13:37:41,724 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 13:37:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:41,726 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-27 13:37:41,726 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-27 13:37:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:41,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:41,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.173913043478261) internal successors, (54), 49 states have internal predecessors, (54), 26 states have call successors, (26), 10 states have call predecessors, (26), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 13:37:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-04-27 13:37:41,728 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 56 [2022-04-27 13:37:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:41,728 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-04-27 13:37:41,729 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:37:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-04-27 13:37:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 13:37:41,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:41,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:37:41,745 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:37:41,944 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:37:41,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 1 times [2022-04-27 13:37:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:41,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088874432] [2022-04-27 13:37:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:41,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:41,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073775955] [2022-04-27 13:37:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:41,960 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:37:41,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process