/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/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:45:56,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:45:56,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:45:56,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:45:56,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:45:56,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:45:56,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:45:56,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:45:56,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:45:56,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:45:56,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:45:56,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:45:56,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:45:56,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:45:56,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:45:56,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:45:56,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:45:56,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:45:56,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:45:56,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:45:56,453 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:45:56,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:45:56,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:45:56,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:45:56,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:45:56,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:45:56,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:45:56,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:45:56,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:45:56,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:45:56,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:45:56,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:45:56,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:45:56,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:45:56,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:45:56,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:45:56,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:45:56,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:45:56,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:45:56,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:45:56,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:45:56,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:45:56,469 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 11:45:56,481 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:45:56,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:45:56,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:45:56,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:45:56,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:45:56,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:45:56,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:45:56,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:45:56,482 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:45:56,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:45:56,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:45:56,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:45:56,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:56,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:45:56,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:45:56,484 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 11:45:56,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:45:56,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:45:56,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:45:56,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:45:56,675 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:45:56,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-27 11:45:56,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8f4fe0e/2eeebb656ab2498c9221e1d1650b85e0/FLAG3d805ef43 [2022-04-27 11:45:57,084 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:45:57,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-27 11:45:57,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8f4fe0e/2eeebb656ab2498c9221e1d1650b85e0/FLAG3d805ef43 [2022-04-27 11:45:57,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e8f4fe0e/2eeebb656ab2498c9221e1d1650b85e0 [2022-04-27 11:45:57,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:45:57,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:45:57,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:57,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:45:57,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:45:57,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78e7c067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57, skipping insertion in model container [2022-04-27 11:45:57,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:45:57,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:45:57,251 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/cohendiv-ll.c[576,589] [2022-04-27 11:45:57,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:57,273 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:45:57,280 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/cohendiv-ll.c[576,589] [2022-04-27 11:45:57,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:57,293 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:45:57,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57 WrapperNode [2022-04-27 11:45:57,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:57,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:45:57,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:45:57,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:45:57,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:45:57,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:45:57,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:45:57,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:45:57,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (1/1) ... [2022-04-27 11:45:57,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:57,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:57,340 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 11:45:57,354 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 11:45:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:45:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:45:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:45:57,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:45:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:45:57,367 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:45:57,367 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:45:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:45:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:45:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:45:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:45:57,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:45:57,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:45:57,413 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:45:57,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:45:57,514 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:45:57,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:45:57,519 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:45:57,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:57 BoogieIcfgContainer [2022-04-27 11:45:57,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:45:57,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:45:57,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:45:57,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:45:57,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:45:57" (1/3) ... [2022-04-27 11:45:57,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ac5247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:57, skipping insertion in model container [2022-04-27 11:45:57,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:57" (2/3) ... [2022-04-27 11:45:57,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ac5247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:57, skipping insertion in model container [2022-04-27 11:45:57,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:57" (3/3) ... [2022-04-27 11:45:57,525 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.c [2022-04-27 11:45:57,534 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:45:57,534 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:45:57,568 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:45:57,575 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@598e5c2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13422dad [2022-04-27 11:45:57,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:45:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 11:45:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:45:57,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:57,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:57,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 1 times [2022-04-27 11:45:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:57,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614685031] [2022-04-27 11:45:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:57,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:57,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(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(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-27 11:45:57,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 11:45:57,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-27 11:45:57,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:57,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-27 11:45:57,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-27 11:45:57,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-27 11:45:57,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-27 11:45:57,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:57,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(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(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-27 11:45:57,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-27 11:45:57,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-27 11:45:57,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2022-04-27 11:45:57,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {39#true} is VALID [2022-04-27 11:45:57,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {39#true} is VALID [2022-04-27 11:45:57,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-27 11:45:57,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-27 11:45:57,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-27 11:45:57,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-27 11:45:57,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {40#false} is VALID [2022-04-27 11:45:57,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume false; {40#false} is VALID [2022-04-27 11:45:57,814 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {40#false} is VALID [2022-04-27 11:45:57,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-27 11:45:57,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-27 11:45:57,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-27 11:45:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:45:57,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:57,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614685031] [2022-04-27 11:45:57,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614685031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:57,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:57,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:45:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940426985] [2022-04-27 11:45:57,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:57,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:45:57,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:57,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:45:57,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:57,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:45:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:45:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:45:57,885 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:45:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:58,056 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-04-27 11:45:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:45:58,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:45:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:45:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 11:45:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:45:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 11:45:58,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 11:45:58,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:58,173 INFO L225 Difference]: With dead ends: 63 [2022-04-27 11:45:58,174 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 11:45:58,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:45:58,180 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:58,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:45:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 11:45:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-27 11:45:58,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:58,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:45:58,202 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:45:58,202 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:45:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:58,205 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 11:45:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 11:45:58,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:58,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:58,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-27 11:45:58,206 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-27 11:45:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:58,209 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-27 11:45:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 11:45:58,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:58,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:58,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:58,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 11:45:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-27 11:45:58,212 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-27 11:45:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:58,212 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-27 11:45:58,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:45:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-27 11:45:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:45:58,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:58,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:58,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:45:58,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 1 times [2022-04-27 11:45:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:58,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544951340] [2022-04-27 11:45:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:58,229 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:45:58,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806845409] [2022-04-27 11:45:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:58,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:58,231 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 11:45:58,232 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 11:45:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:45:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:02,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2022-04-27 11:46:02,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#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(14, 2);call #Ultimate.allocInit(12, 3); {249#true} is VALID [2022-04-27 11:46:02,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-27 11:46:02,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {249#true} {249#true} #91#return; {249#true} is VALID [2022-04-27 11:46:02,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {249#true} call #t~ret6 := main(); {249#true} is VALID [2022-04-27 11:46:02,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {249#true} is VALID [2022-04-27 11:46:02,442 INFO L272 TraceCheckUtils]: 6: Hoare triple {249#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {249#true} is VALID [2022-04-27 11:46:02,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#true} ~cond := #in~cond; {249#true} is VALID [2022-04-27 11:46:02,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#true} assume !(0 == ~cond); {249#true} is VALID [2022-04-27 11:46:02,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#true} assume true; {249#true} is VALID [2022-04-27 11:46:02,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {249#true} {249#true} #75#return; {249#true} is VALID [2022-04-27 11:46:02,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {287#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 11:46:02,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {287#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 11:46:02,444 INFO L272 TraceCheckUtils]: 13: Hoare triple {287#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:02,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:02,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {250#false} is VALID [2022-04-27 11:46:02,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-04-27 11:46:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:46:02,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:46:02,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:02,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544951340] [2022-04-27 11:46:02,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:02,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806845409] [2022-04-27 11:46:02,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806845409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:46:02,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:46:02,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:46:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996174904] [2022-04-27 11:46:02,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:46:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:46:02,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:02,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:46:02,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:02,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:46:02,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:46:02,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:46:02,473 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:46:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:02,611 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 11:46:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:46:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:46:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:46:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 11:46:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:46:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 11:46:02,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-27 11:46:02,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:02,653 INFO L225 Difference]: With dead ends: 42 [2022-04-27 11:46:02,653 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 11:46:02,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 11:46:02,654 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:02,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:46:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 11:46:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-27 11:46:02,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:02,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:46:02,660 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:46:02,661 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:46:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:02,663 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 11:46:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 11:46:02,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:02,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:02,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-27 11:46:02,667 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-27 11:46:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:02,669 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-27 11:46:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 11:46:02,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:02,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:02,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:02,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 11:46:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-27 11:46:02,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-27 11:46:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:02,672 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-27 11:46:02,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:46:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 11:46:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:46:02,673 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:02,673 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:02,695 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 11:46:02,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:02,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:02,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 1 times [2022-04-27 11:46:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:02,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100587604] [2022-04-27 11:46:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:02,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:46:02,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1252222270] [2022-04-27 11:46:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:02,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:02,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:02,919 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 11:46:02,920 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 11:46:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:02,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:46:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:02,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:05,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2022-04-27 11:46:05,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#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(14, 2);call #Ultimate.allocInit(12, 3); {505#true} is VALID [2022-04-27 11:46:05,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2022-04-27 11:46:05,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #91#return; {505#true} is VALID [2022-04-27 11:46:05,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret6 := main(); {505#true} is VALID [2022-04-27 11:46:05,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {505#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {505#true} is VALID [2022-04-27 11:46:05,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {505#true} is VALID [2022-04-27 11:46:05,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#true} ~cond := #in~cond; {505#true} is VALID [2022-04-27 11:46:05,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#true} assume !(0 == ~cond); {505#true} is VALID [2022-04-27 11:46:05,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#true} assume true; {505#true} is VALID [2022-04-27 11:46:05,099 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {505#true} {505#true} #75#return; {505#true} is VALID [2022-04-27 11:46:05,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:05,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:05,100 INFO L272 TraceCheckUtils]: 13: Hoare triple {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {505#true} is VALID [2022-04-27 11:46:05,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#true} ~cond := #in~cond; {505#true} is VALID [2022-04-27 11:46:05,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#true} assume !(0 == ~cond); {505#true} is VALID [2022-04-27 11:46:05,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {505#true} assume true; {505#true} is VALID [2022-04-27 11:46:05,101 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {505#true} {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:05,102 INFO L272 TraceCheckUtils]: 18: Hoare triple {543#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {565#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:05,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {565#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {569#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:05,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {569#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {506#false} is VALID [2022-04-27 11:46:05,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {506#false} assume !false; {506#false} is VALID [2022-04-27 11:46:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:46:05,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:46:05,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:05,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100587604] [2022-04-27 11:46:05,104 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:05,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252222270] [2022-04-27 11:46:05,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252222270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:46:05,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:46:05,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:46:05,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350002015] [2022-04-27 11:46:05,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:46:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:46:05,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:05,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:46:05,122 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 11:46:05,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:46:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:05,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:46:05,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:46:05,123 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:46:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:05,318 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-27 11:46:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:46:05,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:46:05,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:46:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 11:46:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:46:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 11:46:05,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 11:46:05,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:05,382 INFO L225 Difference]: With dead ends: 54 [2022-04-27 11:46:05,382 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 11:46:05,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 11:46:05,387 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:05,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:46:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 11:46:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 11:46:05,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:05,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:46:05,401 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:46:05,401 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:46:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:05,404 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-27 11:46:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-27 11:46:05,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:05,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:05,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-27 11:46:05,405 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-27 11:46:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:05,407 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-27 11:46:05,407 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-27 11:46:05,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:05,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:05,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:05,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:46:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-27 11:46:05,411 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-27 11:46:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:05,411 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-27 11:46:05,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:46:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 11:46:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:46:05,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:05,412 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:05,429 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 11:46:05,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 11:46:05,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:05,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 1 times [2022-04-27 11:46:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:05,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792035414] [2022-04-27 11:46:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:05,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:05,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:46:05,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790651694] [2022-04-27 11:46:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:05,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:05,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:05,644 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 11:46:05,645 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 11:46:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:05,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:46:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:05,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:05,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-27 11:46:05,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#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(14, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-27 11:46:05,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 11:46:05,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #91#return; {836#true} is VALID [2022-04-27 11:46:05,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret6 := main(); {836#true} is VALID [2022-04-27 11:46:05,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {836#true} is VALID [2022-04-27 11:46:05,786 INFO L272 TraceCheckUtils]: 6: Hoare triple {836#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {836#true} is VALID [2022-04-27 11:46:05,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#true} ~cond := #in~cond; {836#true} is VALID [2022-04-27 11:46:05,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#true} assume !(0 == ~cond); {836#true} is VALID [2022-04-27 11:46:05,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 11:46:05,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {836#true} {836#true} #75#return; {836#true} is VALID [2022-04-27 11:46:05,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {836#true} is VALID [2022-04-27 11:46:05,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {836#true} assume !false; {836#true} is VALID [2022-04-27 11:46:05,786 INFO L272 TraceCheckUtils]: 13: Hoare triple {836#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {836#true} is VALID [2022-04-27 11:46:05,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {836#true} ~cond := #in~cond; {836#true} is VALID [2022-04-27 11:46:05,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#true} assume !(0 == ~cond); {836#true} is VALID [2022-04-27 11:46:05,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 11:46:05,787 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {836#true} {836#true} #77#return; {836#true} is VALID [2022-04-27 11:46:05,787 INFO L272 TraceCheckUtils]: 18: Hoare triple {836#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {836#true} is VALID [2022-04-27 11:46:05,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {836#true} ~cond := #in~cond; {836#true} is VALID [2022-04-27 11:46:05,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {836#true} assume !(0 == ~cond); {836#true} is VALID [2022-04-27 11:46:05,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-27 11:46:05,787 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {836#true} {836#true} #79#return; {836#true} is VALID [2022-04-27 11:46:05,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {836#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 11:46:05,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !false; {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-27 11:46:05,792 INFO L272 TraceCheckUtils]: 25: Hoare triple {910#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:05,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:05,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {837#false} is VALID [2022-04-27 11:46:05,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-27 11:46:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:46:05,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:46:05,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:05,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792035414] [2022-04-27 11:46:05,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:05,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790651694] [2022-04-27 11:46:05,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790651694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:46:05,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:46:05,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:46:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894182287] [2022-04-27 11:46:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:46:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 29 [2022-04-27 11:46:05,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:05,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 11:46:05,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:05,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:46:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:46:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:46:05,819 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 11:46:05,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:05,996 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-04-27 11:46:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:46:05,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 29 [2022-04-27 11:46:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 11:46:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 11:46:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 11:46:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 11:46:05,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 11:46:06,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:06,046 INFO L225 Difference]: With dead ends: 76 [2022-04-27 11:46:06,047 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 11:46:06,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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 11:46:06,047 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:06,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:46:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 11:46:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-27 11:46:06,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:06,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,060 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,060 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:06,063 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-27 11:46:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-27 11:46:06,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:06,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:06,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-27 11:46:06,065 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-27 11:46:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:06,067 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-27 11:46:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-27 11:46:06,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:06,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:06,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:06,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-27 11:46:06,078 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-27 11:46:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:06,078 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-27 11:46:06,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 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 11:46:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-27 11:46:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 11:46:06,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:06,079 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:06,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:46:06,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:06,280 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 1 times [2022-04-27 11:46:06,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:06,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859533451] [2022-04-27 11:46:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:06,290 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:46:06,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037932443] [2022-04-27 11:46:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:06,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:06,292 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 11:46:06,293 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 11:46:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:06,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:46:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:06,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:06,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} call ULTIMATE.init(); {1298#true} is VALID [2022-04-27 11:46:06,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#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(14, 2);call #Ultimate.allocInit(12, 3); {1298#true} is VALID [2022-04-27 11:46:06,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 11:46:06,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} #91#return; {1298#true} is VALID [2022-04-27 11:46:06,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} call #t~ret6 := main(); {1298#true} is VALID [2022-04-27 11:46:06,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1298#true} is VALID [2022-04-27 11:46:06,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {1298#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1298#true} is VALID [2022-04-27 11:46:06,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#true} ~cond := #in~cond; {1324#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:06,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:06,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1328#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:06,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1328#(not (= |assume_abort_if_not_#in~cond| 0))} {1298#true} #75#return; {1335#(<= 1 main_~y~0)} is VALID [2022-04-27 11:46:06,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1335#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1335#(<= 1 main_~y~0)} is VALID [2022-04-27 11:46:06,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {1335#(<= 1 main_~y~0)} assume !false; {1335#(<= 1 main_~y~0)} is VALID [2022-04-27 11:46:06,504 INFO L272 TraceCheckUtils]: 13: Hoare triple {1335#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1298#true} is VALID [2022-04-27 11:46:06,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#true} ~cond := #in~cond; {1298#true} is VALID [2022-04-27 11:46:06,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#true} assume !(0 == ~cond); {1298#true} is VALID [2022-04-27 11:46:06,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 11:46:06,505 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1298#true} {1335#(<= 1 main_~y~0)} #77#return; {1335#(<= 1 main_~y~0)} is VALID [2022-04-27 11:46:06,505 INFO L272 TraceCheckUtils]: 18: Hoare triple {1335#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1298#true} is VALID [2022-04-27 11:46:06,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1298#true} ~cond := #in~cond; {1298#true} is VALID [2022-04-27 11:46:06,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1298#true} assume !(0 == ~cond); {1298#true} is VALID [2022-04-27 11:46:06,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 11:46:06,506 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1298#true} {1335#(<= 1 main_~y~0)} #79#return; {1335#(<= 1 main_~y~0)} is VALID [2022-04-27 11:46:06,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1375#(<= 1 main_~r~0)} is VALID [2022-04-27 11:46:06,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {1375#(<= 1 main_~r~0)} assume !false; {1375#(<= 1 main_~r~0)} is VALID [2022-04-27 11:46:06,508 INFO L272 TraceCheckUtils]: 25: Hoare triple {1375#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1298#true} is VALID [2022-04-27 11:46:06,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#true} ~cond := #in~cond; {1298#true} is VALID [2022-04-27 11:46:06,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {1298#true} assume !(0 == ~cond); {1298#true} is VALID [2022-04-27 11:46:06,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 11:46:06,514 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1298#true} {1375#(<= 1 main_~r~0)} #81#return; {1375#(<= 1 main_~r~0)} is VALID [2022-04-27 11:46:06,514 INFO L272 TraceCheckUtils]: 30: Hoare triple {1375#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1298#true} is VALID [2022-04-27 11:46:06,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {1298#true} ~cond := #in~cond; {1298#true} is VALID [2022-04-27 11:46:06,515 INFO L290 TraceCheckUtils]: 32: Hoare triple {1298#true} assume !(0 == ~cond); {1298#true} is VALID [2022-04-27 11:46:06,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-04-27 11:46:06,515 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1298#true} {1375#(<= 1 main_~r~0)} #83#return; {1375#(<= 1 main_~r~0)} is VALID [2022-04-27 11:46:06,516 INFO L272 TraceCheckUtils]: 35: Hoare triple {1375#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:06,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {1412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:06,517 INFO L290 TraceCheckUtils]: 37: Hoare triple {1416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1299#false} is VALID [2022-04-27 11:46:06,517 INFO L290 TraceCheckUtils]: 38: Hoare triple {1299#false} assume !false; {1299#false} is VALID [2022-04-27 11:46:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:46:06,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:46:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:06,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859533451] [2022-04-27 11:46:06,517 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:06,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037932443] [2022-04-27 11:46:06,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037932443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:46:06,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:46:06,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:46:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215432274] [2022-04-27 11:46:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:46:06,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-27 11:46:06,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:06,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 11:46:06,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:06,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:46:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:06,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:46:06,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:46:06,540 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 11:46:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:06,823 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-27 11:46:06,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:46:06,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-27 11:46:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 11:46:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 11:46:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 11:46:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 11:46:06,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 11:46:06,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:06,862 INFO L225 Difference]: With dead ends: 73 [2022-04-27 11:46:06,862 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 11:46:06,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:46:06,863 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:06,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:46:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 11:46:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 11:46:06,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:06,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,911 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,911 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:06,915 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-27 11:46:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 11:46:06,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:06,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:06,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-27 11:46:06,916 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-27 11:46:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:06,918 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-27 11:46:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 11:46:06,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:06,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:06,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:06,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-27 11:46:06,921 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-27 11:46:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:06,921 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-27 11:46:06,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 11:46:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-27 11:46:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 11:46:06,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:06,922 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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 11:46:06,937 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 11:46:07,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:07,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 1 times [2022-04-27 11:46:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:07,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738390734] [2022-04-27 11:46:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:07,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:46:07,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1440331646] [2022-04-27 11:46:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:07,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:07,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:07,167 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 11:46:07,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:46:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:07,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 11:46:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:07,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:07,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2022-04-27 11:46:07,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1790#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(14, 2);call #Ultimate.allocInit(12, 3); {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #91#return; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret6 := main(); {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {1790#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L272 TraceCheckUtils]: 6: Hoare triple {1790#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1790#true} {1790#true} #75#return; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#true} assume !false; {1790#true} is VALID [2022-04-27 11:46:07,359 INFO L272 TraceCheckUtils]: 13: Hoare triple {1790#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1790#true} #77#return; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L272 TraceCheckUtils]: 18: Hoare triple {1790#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1790#true} {1790#true} #79#return; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {1790#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {1790#true} assume !false; {1790#true} is VALID [2022-04-27 11:46:07,360 INFO L272 TraceCheckUtils]: 25: Hoare triple {1790#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:07,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {1790#true} ~cond := #in~cond; {1873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:07,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {1873#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:07,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:07,362 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} {1790#true} #81#return; {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 11:46:07,362 INFO L272 TraceCheckUtils]: 30: Hoare triple {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:07,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:07,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:07,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:07,364 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} #83#return; {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 11:46:07,364 INFO L272 TraceCheckUtils]: 35: Hoare triple {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:07,364 INFO L290 TraceCheckUtils]: 36: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:07,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:07,364 INFO L290 TraceCheckUtils]: 38: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:07,364 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1790#true} {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-27 11:46:07,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {1884#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 11:46:07,365 INFO L272 TraceCheckUtils]: 41: Hoare triple {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:07,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:07,366 INFO L290 TraceCheckUtils]: 43: Hoare triple {1926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1791#false} is VALID [2022-04-27 11:46:07,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2022-04-27 11:46:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:46:07,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:46:11,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {1791#false} assume !false; {1791#false} is VALID [2022-04-27 11:46:11,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {1926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1791#false} is VALID [2022-04-27 11:46:11,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:11,785 INFO L272 TraceCheckUtils]: 41: Hoare triple {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {1922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:11,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {1918#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-27 11:46:11,786 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1790#true} {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 11:46:11,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:11,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:11,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:11,786 INFO L272 TraceCheckUtils]: 35: Hoare triple {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:11,789 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1790#true} {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #83#return; {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 11:46:11,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:11,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:11,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:11,790 INFO L272 TraceCheckUtils]: 30: Hoare triple {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:11,791 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} {1790#true} #81#return; {1945#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-27 11:46:11,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {1988#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1877#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {1790#true} ~cond := #in~cond; {1988#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:46:11,792 INFO L272 TraceCheckUtils]: 25: Hoare triple {1790#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {1790#true} assume !false; {1790#true} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {1790#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1790#true} is VALID [2022-04-27 11:46:11,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1790#true} {1790#true} #79#return; {1790#true} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:11,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L272 TraceCheckUtils]: 18: Hoare triple {1790#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1790#true} {1790#true} #77#return; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L272 TraceCheckUtils]: 13: Hoare triple {1790#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1790#true} assume !false; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1790#true} {1790#true} #75#return; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1790#true} assume !(0 == ~cond); {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1790#true} ~cond := #in~cond; {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L272 TraceCheckUtils]: 6: Hoare triple {1790#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1790#true} is VALID [2022-04-27 11:46:11,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {1790#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1790#true} is VALID [2022-04-27 11:46:11,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {1790#true} call #t~ret6 := main(); {1790#true} is VALID [2022-04-27 11:46:11,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1790#true} {1790#true} #91#return; {1790#true} is VALID [2022-04-27 11:46:11,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {1790#true} assume true; {1790#true} is VALID [2022-04-27 11:46:11,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {1790#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(14, 2);call #Ultimate.allocInit(12, 3); {1790#true} is VALID [2022-04-27 11:46:11,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {1790#true} call ULTIMATE.init(); {1790#true} is VALID [2022-04-27 11:46:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:46:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738390734] [2022-04-27 11:46:11,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440331646] [2022-04-27 11:46:11,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440331646] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:46:11,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:46:11,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 11:46:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348476820] [2022-04-27 11:46:11,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:46:11,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-27 11:46:11,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:11,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 11:46:11,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:11,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:46:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:46:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:46:11,837 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 11:46:12,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:12,255 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-27 11:46:12,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:46:12,255 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 45 [2022-04-27 11:46:12,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 11:46:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 11:46:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 11:46:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 11:46:12,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 11:46:12,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:12,300 INFO L225 Difference]: With dead ends: 77 [2022-04-27 11:46:12,301 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 11:46:12,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:46:12,301 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:12,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 136 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:46:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 11:46:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 11:46:12,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:12,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:12,331 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:12,331 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:12,333 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-27 11:46:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-27 11:46:12,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:12,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:12,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-27 11:46:12,334 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-27 11:46:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:12,336 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-27 11:46:12,336 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-27 11:46:12,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:12,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:12,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:12,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:46:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-27 11:46:12,339 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-27 11:46:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:12,339 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-27 11:46:12,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-27 11:46:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-27 11:46:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 11:46:12,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:12,340 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:12,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:46:12,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:12,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 1 times [2022-04-27 11:46:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:12,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485135145] [2022-04-27 11:46:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:12,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:46:12,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80243639] [2022-04-27 11:46:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:12,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:12,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:46:12,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:46:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:12,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:46:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:12,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:13,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {2455#true} call ULTIMATE.init(); {2455#true} is VALID [2022-04-27 11:46:13,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#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(14, 2);call #Ultimate.allocInit(12, 3); {2455#true} is VALID [2022-04-27 11:46:13,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2455#true} {2455#true} #91#return; {2455#true} is VALID [2022-04-27 11:46:13,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {2455#true} call #t~ret6 := main(); {2455#true} is VALID [2022-04-27 11:46:13,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {2455#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2455#true} is VALID [2022-04-27 11:46:13,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {2455#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-27 11:46:13,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-27 11:46:13,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2455#true} {2455#true} #75#return; {2455#true} is VALID [2022-04-27 11:46:13,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {2455#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,052 INFO L272 TraceCheckUtils]: 13: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-27 11:46:13,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-27 11:46:13,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,053 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2455#true} {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,053 INFO L272 TraceCheckUtils]: 18: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-27 11:46:13,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-27 11:46:13,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,055 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2455#true} {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {2493#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,057 INFO L272 TraceCheckUtils]: 25: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-27 11:46:13,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-27 11:46:13,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,058 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2455#true} {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #81#return; {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,058 INFO L272 TraceCheckUtils]: 30: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-27 11:46:13,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-27 11:46:13,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,059 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2455#true} {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,059 INFO L272 TraceCheckUtils]: 35: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {2455#true} ~cond := #in~cond; {2455#true} is VALID [2022-04-27 11:46:13,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {2455#true} assume !(0 == ~cond); {2455#true} is VALID [2022-04-27 11:46:13,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {2455#true} assume true; {2455#true} is VALID [2022-04-27 11:46:13,059 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2455#true} {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {2530#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {2582#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:46:13,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {2582#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= main_~y~0 main_~r~0) (not (<= (* main_~b~0 2) main_~r~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-27 11:46:13,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} assume !false; {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} is VALID [2022-04-27 11:46:13,062 INFO L272 TraceCheckUtils]: 43: Hoare triple {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2455#true} is VALID [2022-04-27 11:46:13,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {2455#true} ~cond := #in~cond; {2596#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:13,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {2596#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:13,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:13,074 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2600#(not (= |__VERIFIER_assert_#in~cond| 0))} {2586#(and (= (+ (* (- 1) main_~a~0) main_~q~0) 0) (= main_~a~0 1) (= main_~x~0 (+ main_~b~0 main_~r~0)) (= main_~b~0 main_~y~0) (<= main_~y~0 (+ main_~b~0 main_~r~0)) (not (<= main_~b~0 main_~r~0)))} #77#return; {2607#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} is VALID [2022-04-27 11:46:13,075 INFO L272 TraceCheckUtils]: 48: Hoare triple {2607#(and (= main_~x~0 (+ main_~y~0 main_~r~0)) (= main_~q~0 1) (<= main_~y~0 main_~x~0) (< (* main_~r~0 2) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2611#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:13,076 INFO L290 TraceCheckUtils]: 49: Hoare triple {2611#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2615#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:13,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {2615#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2456#false} is VALID [2022-04-27 11:46:13,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-04-27 11:46:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-27 11:46:13,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:46:59,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:59,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485135145] [2022-04-27 11:46:59,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:46:59,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80243639] [2022-04-27 11:46:59,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80243639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:46:59,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:46:59,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-27 11:46:59,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545808172] [2022-04-27 11:46:59,803 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 11:46:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-27 11:46:59,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:59,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 11:46:59,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:59,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:46:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:46:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:46:59,845 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 11:47:00,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:00,519 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2022-04-27 11:47:00,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:47:00,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2022-04-27 11:47:00,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:47:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 11:47:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-04-27 11:47:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 11:47:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-04-27 11:47:00,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 108 transitions. [2022-04-27 11:47:00,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:00,612 INFO L225 Difference]: With dead ends: 131 [2022-04-27 11:47:00,612 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 11:47:00,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:47:00,613 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:00,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 129 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:47:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 11:47:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-27 11:47:00,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:00,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:47:00,657 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:47:00,658 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:47:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:00,660 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 11:47:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 11:47:00,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:00,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:00,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 11:47:00,661 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-27 11:47:00,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:00,663 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-27 11:47:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-27 11:47:00,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:00,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:00,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:00,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-27 11:47:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2022-04-27 11:47:00,666 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 52 [2022-04-27 11:47:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:00,666 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2022-04-27 11:47:00,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-27 11:47:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 11:47:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-27 11:47:00,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:47:00,667 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:00,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:47:00,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:00,883 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:47:00,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:47:00,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1695528703, now seen corresponding path program 1 times [2022-04-27 11:47:00,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:47:00,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729797938] [2022-04-27 11:47:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:47:00,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:47:00,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037684147] [2022-04-27 11:47:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:00,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:00,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:47:00,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:47:00,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 11:47:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:00,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:47:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:00,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:47:01,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {3199#true} call ULTIMATE.init(); {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {3199#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(14, 2);call #Ultimate.allocInit(12, 3); {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3199#true} {3199#true} #91#return; {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {3199#true} call #t~ret6 := main(); {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {3199#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {3199#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3199#true} {3199#true} #75#return; {3199#true} is VALID [2022-04-27 11:47:01,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {3199#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,475 INFO L272 TraceCheckUtils]: 13: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,476 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3199#true} {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,476 INFO L272 TraceCheckUtils]: 18: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,476 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3199#true} {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,477 INFO L290 TraceCheckUtils]: 23: Hoare triple {3237#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,477 INFO L272 TraceCheckUtils]: 25: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,478 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3199#true} {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #81#return; {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,478 INFO L272 TraceCheckUtils]: 30: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,479 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3199#true} {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,479 INFO L272 TraceCheckUtils]: 35: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,480 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3199#true} {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {3274#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(~r~0 >= 2 * ~b~0); {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,480 INFO L272 TraceCheckUtils]: 41: Hoare triple {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,481 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3199#true} {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 11:47:01,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {3326#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (<= (* main_~b~0 2) main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 11:47:01,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} assume !false; {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 11:47:01,482 INFO L272 TraceCheckUtils]: 48: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,483 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3199#true} {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} #81#return; {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 11:47:01,483 INFO L272 TraceCheckUtils]: 53: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,484 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3199#true} {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} #83#return; {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 11:47:01,484 INFO L272 TraceCheckUtils]: 58: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,484 INFO L290 TraceCheckUtils]: 59: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,484 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3199#true} {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} #85#return; {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 11:47:01,485 INFO L290 TraceCheckUtils]: 63: Hoare triple {3345#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} assume !(~r~0 >= 2 * ~b~0); {3397#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} is VALID [2022-04-27 11:47:01,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {3397#(and (= main_~x~0 main_~r~0) (= main_~b~0 (* main_~y~0 2)) (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~y~0 2) main_~r~0) (= main_~q~0 0) (= main_~a~0 2))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 11:47:01,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} assume !false; {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 11:47:01,486 INFO L272 TraceCheckUtils]: 66: Hoare triple {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,486 INFO L290 TraceCheckUtils]: 68: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,486 INFO L290 TraceCheckUtils]: 69: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,487 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3199#true} {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} #77#return; {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} is VALID [2022-04-27 11:47:01,487 INFO L272 TraceCheckUtils]: 71: Hoare triple {3401#(and (= main_~q~0 2) (not (<= (* main_~y~0 2) main_~r~0)) (<= 0 main_~r~0) (= main_~x~0 (+ main_~r~0 (* main_~y~0 2))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:47:01,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:01,488 INFO L290 TraceCheckUtils]: 73: Hoare triple {3427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3200#false} is VALID [2022-04-27 11:47:01,488 INFO L290 TraceCheckUtils]: 74: Hoare triple {3200#false} assume !false; {3200#false} is VALID [2022-04-27 11:47:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 11:47:01,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:47:01,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {3200#false} assume !false; {3200#false} is VALID [2022-04-27 11:47:01,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {3427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3200#false} is VALID [2022-04-27 11:47:01,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:01,997 INFO L272 TraceCheckUtils]: 71: Hoare triple {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:47:01,997 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3199#true} {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #77#return; {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 11:47:01,997 INFO L290 TraceCheckUtils]: 69: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:01,998 INFO L290 TraceCheckUtils]: 68: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:01,998 INFO L290 TraceCheckUtils]: 67: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:01,998 INFO L272 TraceCheckUtils]: 66: Hoare triple {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:01,998 INFO L290 TraceCheckUtils]: 65: Hoare triple {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 11:47:02,005 INFO L290 TraceCheckUtils]: 64: Hoare triple {3465#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {3443#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 11:47:02,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} assume !(~r~0 >= 2 * ~b~0); {3465#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 11:47:02,006 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {3199#true} {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} #85#return; {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 11:47:02,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,006 INFO L272 TraceCheckUtils]: 58: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,007 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3199#true} {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} #83#return; {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 11:47:02,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,007 INFO L272 TraceCheckUtils]: 53: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,008 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3199#true} {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} #81#return; {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 11:47:02,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,008 INFO L290 TraceCheckUtils]: 50: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,008 INFO L290 TraceCheckUtils]: 49: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,008 INFO L272 TraceCheckUtils]: 48: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,009 INFO L290 TraceCheckUtils]: 47: Hoare triple {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} assume !false; {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 11:47:02,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} ~a~0 := 2 * ~a~0;~b~0 := 2 * ~b~0; {3469#(or (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (<= (* main_~b~0 2) main_~r~0))} is VALID [2022-04-27 11:47:02,014 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3199#true} {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} #87#return; {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,014 INFO L272 TraceCheckUtils]: 41: Hoare triple {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} assume !!(~r~0 >= 2 * ~b~0); {3521#(or (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,017 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3199#true} {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} #85#return; {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,018 INFO L290 TraceCheckUtils]: 37: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,018 INFO L272 TraceCheckUtils]: 35: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,018 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3199#true} {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} #83#return; {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,019 INFO L272 TraceCheckUtils]: 30: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,019 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3199#true} {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} #81#return; {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,019 INFO L272 TraceCheckUtils]: 25: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} assume !false; {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3540#(or (not (<= (* main_~b~0 2) main_~r~0)) (<= (* main_~b~0 4) main_~r~0) (= (+ (* (- 2) main_~b~0) (* (+ (* main_~a~0 2) main_~q~0) main_~y~0) main_~r~0) main_~x~0))} is VALID [2022-04-27 11:47:02,021 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3199#true} {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} #79#return; {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 11:47:02,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,021 INFO L272 TraceCheckUtils]: 18: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,021 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3199#true} {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} #77#return; {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 11:47:02,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,022 INFO L272 TraceCheckUtils]: 13: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} assume !false; {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 11:47:02,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {3199#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3592#(or (= main_~x~0 (+ main_~r~0 (* (+ main_~q~0 2) main_~y~0) (* (- 2) main_~y~0))) (<= (* main_~y~0 4) main_~r~0) (not (<= (* main_~y~0 2) main_~r~0)))} is VALID [2022-04-27 11:47:02,022 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3199#true} {3199#true} #75#return; {3199#true} is VALID [2022-04-27 11:47:02,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {3199#true} assume !(0 == ~cond); {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {3199#true} ~cond := #in~cond; {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {3199#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {3199#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {3199#true} call #t~ret6 := main(); {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3199#true} {3199#true} #91#return; {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {3199#true} assume true; {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {3199#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(14, 2);call #Ultimate.allocInit(12, 3); {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {3199#true} call ULTIMATE.init(); {3199#true} is VALID [2022-04-27 11:47:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-27 11:47:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:47:02,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729797938] [2022-04-27 11:47:02,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:47:02,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037684147] [2022-04-27 11:47:02,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037684147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:47:02,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:47:02,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-27 11:47:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575482369] [2022-04-27 11:47:02,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:47:02,024 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-27 11:47:02,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:47:02,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 11:47:02,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:02,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 11:47:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:47:02,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 11:47:02,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-04-27 11:47:02,098 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 11:47:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:04,173 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2022-04-27 11:47:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:47:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 75 [2022-04-27 11:47:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:47:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 11:47:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-27 11:47:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 11:47:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-04-27 11:47:04,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2022-04-27 11:47:04,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:04,297 INFO L225 Difference]: With dead ends: 117 [2022-04-27 11:47:04,297 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:47:04,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:47:04,298 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:04,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 162 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:47:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:47:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:47:04,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:04,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:47:04,299 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:47:04,299 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:47:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:04,299 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:47:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:47:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:04,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:04,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:47:04,299 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:47:04,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:04,299 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:47:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:47:04,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:04,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:04,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:04,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:47:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:47:04,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-04-27 11:47:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:04,300 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:47:04,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 11 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2022-04-27 11:47:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:47:04,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:04,302 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:47:04,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:47:04,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:04,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:47:05,103 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 11:47:05,103 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 11:47:05,103 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 22 64) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L48(lines 45 57) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,104 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 22 64) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L38(lines 36 60) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 60) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,104 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 60) the Hoare annotation is: (or (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0)))) [2022-04-27 11:47:05,104 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 64) the Hoare annotation is: true [2022-04-27 11:47:05,104 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,104 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2022-04-27 11:47:05,104 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,105 INFO L895 garLoopResultBuilder]: At program point L45-2(lines 45 57) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (<= 1 main_~r~0) (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point L45-3(lines 45 57) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,105 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0 .cse0) (+ main_~b~0 main_~x~0)) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:47:05,105 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 11:47:05,105 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 11:47:05,107 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:05,108 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:47:05,110 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:47:05,110 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:47:05,117 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:47:05,118 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 11:47:05,119 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:47:05,120 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:47:05,120 INFO L163 areAnnotationChecker]: CFG has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:47:05,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:47:05 BoogieIcfgContainer [2022-04-27 11:47:05,127 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:47:05,128 INFO L158 Benchmark]: Toolchain (without parser) took 68027.21ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 155.6MB in the end (delta: -25.9MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. [2022-04-27 11:47:05,128 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:47:05,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.49ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 155.7MB in the end (delta: -26.2MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-27 11:47:05,128 INFO L158 Benchmark]: Boogie Preprocessor took 18.17ms. Allocated memory is still 180.4MB. Free memory was 155.7MB in the beginning and 154.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:47:05,128 INFO L158 Benchmark]: RCFGBuilder took 207.52ms. Allocated memory is still 180.4MB. Free memory was 154.2MB in the beginning and 142.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:47:05,129 INFO L158 Benchmark]: TraceAbstraction took 67605.62ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 141.6MB in the beginning and 155.6MB in the end (delta: -14.0MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. [2022-04-27 11:47:05,129 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.49ms. Allocated memory is still 180.4MB. Free memory was 129.5MB in the beginning and 155.7MB in the end (delta: -26.2MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.17ms. Allocated memory is still 180.4MB. Free memory was 155.7MB in the beginning and 154.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 207.52ms. Allocated memory is still 180.4MB. Free memory was 154.2MB in the beginning and 142.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 67605.62ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 141.6MB in the beginning and 155.6MB in the end (delta: -14.0MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.5s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 988 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 712 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1000 IncrementalHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 276 mSDtfsCounter, 1000 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 373 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 72 PreInvPairs, 123 NumberOfFragments, 232 HoareAnnotationTreeSize, 72 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 1781 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1447 SizeOfPredicates, 20 NumberOfNonLiveVariables, 819 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 602/633 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= r && q * y + r + a * y == b + x) && 1 <= y) && b == a * y - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (q * y + r + a * y == b + x && 1 <= y) && b == a * y RESULT: Ultimate proved your program to be correct! [2022-04-27 11:47:05,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...