/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:26:10,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:26:10,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:26:10,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:26:10,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:26:10,394 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:26:10,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:26:10,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:26:10,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:26:10,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:26:10,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:26:10,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:26:10,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:26:10,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:26:10,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:26:10,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:26:10,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:26:10,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:26:10,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:26:10,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:26:10,427 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:26:10,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:26:10,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:26:10,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:26:10,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:26:10,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:26:10,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:26:10,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:26:10,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:26:10,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:26:10,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:26:10,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:26:10,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:26:10,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:26:10,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:26:10,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:26:10,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:26:10,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:26:10,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:26:10,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:26:10,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:26:10,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:26:10,444 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 14:26:10,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:26:10,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:26:10,465 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:26:10,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:26:10,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:26:10,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:26:10,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:26:10,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:26:10,466 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:26:10,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:26:10,466 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:26:10,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:26:10,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:26:10,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:26:10,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:26:10,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:26:10,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:26:10,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:26:10,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:26:10,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:26:10,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:26:10,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:26:10,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:26:10,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:26:10,471 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:26:10,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:26:10,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:26:10,472 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 14:26:10,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:26:10,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:26:10,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:26:10,621 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:26:10,621 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:26:10,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2022-04-27 14:26:10,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d13a6de7/3b89bc37a393417abd999895ddc0b603/FLAG2e8b39c1b [2022-04-27 14:26:11,034 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:26:11,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2022-04-27 14:26:11,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d13a6de7/3b89bc37a393417abd999895ddc0b603/FLAG2e8b39c1b [2022-04-27 14:26:11,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d13a6de7/3b89bc37a393417abd999895ddc0b603 [2022-04-27 14:26:11,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:26:11,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:26:11,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:26:11,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:26:11,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:26:11,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d830db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11, skipping insertion in model container [2022-04-27 14:26:11,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:26:11,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:26:11,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c[524,537] [2022-04-27 14:26:11,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:26:11,224 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:26:11,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c[524,537] [2022-04-27 14:26:11,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:26:11,260 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:26:11,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11 WrapperNode [2022-04-27 14:26:11,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:26:11,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:26:11,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:26:11,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:26:11,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:26:11,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:26:11,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:26:11,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:26:11,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (1/1) ... [2022-04-27 14:26:11,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:26:11,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:11,322 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 14:26:11,328 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 14:26:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:26:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:26:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:26:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:26:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:26:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:26:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:26:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:26:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:26:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:26:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:26:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:26:11,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:26:11,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:26:11,409 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:26:11,410 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:26:11,600 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:26:11,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:26:11,605 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:26:11,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:26:11 BoogieIcfgContainer [2022-04-27 14:26:11,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:26:11,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:26:11,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:26:11,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:26:11,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:26:11" (1/3) ... [2022-04-27 14:26:11,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beac247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:26:11, skipping insertion in model container [2022-04-27 14:26:11,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:26:11" (2/3) ... [2022-04-27 14:26:11,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beac247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:26:11, skipping insertion in model container [2022-04-27 14:26:11,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:26:11" (3/3) ... [2022-04-27 14:26:11,612 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound5.c [2022-04-27 14:26:11,621 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:26:11,621 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:26:11,655 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:26:11,661 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@6c866738, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67fe16f2 [2022-04-27 14:26:11,662 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:26:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:26:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:26:11,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:11,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:11,675 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-27 14:26:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:11,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408005418] [2022-04-27 14:26:11,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:26:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:11,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-27 14:26:11,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 14:26:11,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-27 14:26:11,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 14:26:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:11,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:26:11,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:26:11,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:26:11,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-27 14:26:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 14:26:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:11,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:26:11,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:26:11,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:26:11,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-27 14:26:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 14:26:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:11,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:26:11,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:26:11,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:26:11,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-27 14:26:11,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:26:11,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-27 14:26:11,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 14:26:11,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-27 14:26:11,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-27 14:26:11,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-27 14:26:11,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {37#true} is VALID [2022-04-27 14:26:11,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:26:11,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:26:11,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:26:11,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-27 14:26:11,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-27 14:26:11,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {37#true} is VALID [2022-04-27 14:26:11,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:26:11,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:26:11,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:26:11,886 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-27 14:26:11,886 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 14:26:11,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 14:26:11,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 14:26:11,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 14:26:11,888 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-27 14:26:11,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-27 14:26:11,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 14:26:11,888 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-27 14:26:11,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 14:26:11,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 14:26:11,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 14:26:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:26:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:11,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408005418] [2022-04-27 14:26:11,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408005418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:26:11,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:26:11,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:26:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242254863] [2022-04-27 14:26:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:26:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:26:11,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:11,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:26:11,929 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 14:26:11,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:26:11,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:26:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:26:11,953 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:26:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:12,073 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-27 14:26:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:26:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 14:26:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:26:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-27 14:26:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:26:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-27 14:26:12,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-27 14:26:12,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:12,193 INFO L225 Difference]: With dead ends: 61 [2022-04-27 14:26:12,193 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 14:26:12,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:26:12,198 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:12,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:26:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 14:26:12,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 14:26:12,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:12,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:12,225 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:12,225 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:12,232 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 14:26:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:26:12,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:12,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:12,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 14:26:12,234 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 14:26:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:12,245 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-27 14:26:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:26:12,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:12,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:12,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:12,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-27 14:26:12,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-27 14:26:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:12,254 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-27 14:26:12,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:26:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-27 14:26:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 14:26:12,256 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:12,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:12,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:26:12,256 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:12,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-27 14:26:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:12,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8318427] [2022-04-27 14:26:12,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:12,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:12,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:12,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5675558] [2022-04-27 14:26:12,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:12,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:12,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:12,293 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 14:26:12,294 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 14:26:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:12,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 14:26:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:12,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:12,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-27 14:26:12,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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(13, 2);call #Ultimate.allocInit(12, 3); {239#true} is VALID [2022-04-27 14:26:12,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:26:12,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-27 14:26:12,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-27 14:26:12,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {239#true} is VALID [2022-04-27 14:26:12,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {239#true} is VALID [2022-04-27 14:26:12,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:26:12,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:12,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:12,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {239#true} #71#return; {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:26:12,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:26:12,700 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {239#true} is VALID [2022-04-27 14:26:12,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-27 14:26:12,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-27 14:26:12,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:26:12,701 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:26:12,702 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-27 14:26:12,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:26:12,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:12,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:12,703 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {276#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {310#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-27 14:26:12,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {310#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {314#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 14:26:12,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {314#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {314#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 14:26:12,705 INFO L272 TraceCheckUtils]: 24: Hoare triple {314#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:12,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:12,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-27 14:26:12,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-27 14:26:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:26:12,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:26:12,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-27 14:26:12,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-27 14:26:12,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:12,947 INFO L272 TraceCheckUtils]: 24: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:12,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:12,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {239#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:12,948 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {239#true} {239#true} #75#return; {239#true} is VALID [2022-04-27 14:26:12,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:26:12,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-27 14:26:12,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-27 14:26:12,949 INFO L272 TraceCheckUtils]: 17: Hoare triple {239#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-27 14:26:12,949 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {239#true} #73#return; {239#true} is VALID [2022-04-27 14:26:12,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:26:12,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-27 14:26:12,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-27 14:26:12,950 INFO L272 TraceCheckUtils]: 12: Hoare triple {239#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {239#true} is VALID [2022-04-27 14:26:12,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {239#true} is VALID [2022-04-27 14:26:12,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {239#true} {239#true} #71#return; {239#true} is VALID [2022-04-27 14:26:12,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:26:12,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-27 14:26:12,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-27 14:26:12,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {239#true} is VALID [2022-04-27 14:26:12,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {239#true} is VALID [2022-04-27 14:26:12,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-27 14:26:12,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-27 14:26:12,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-27 14:26:12,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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(13, 2);call #Ultimate.allocInit(12, 3); {239#true} is VALID [2022-04-27 14:26:12,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-27 14:26:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:26:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:12,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8318427] [2022-04-27 14:26:12,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:12,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5675558] [2022-04-27 14:26:12,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5675558] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:26:12,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:26:12,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-27 14:26:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904552154] [2022-04-27 14:26:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:26:12,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 28 [2022-04-27 14:26:12,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:12,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:26:12,968 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 14:26:12,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:26:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:26:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:26:12,969 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:26:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:13,209 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 14:26:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:26:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 28 [2022-04-27 14:26:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:26:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:26:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:26:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:26:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 14:26:13,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 14:26:13,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:13,280 INFO L225 Difference]: With dead ends: 35 [2022-04-27 14:26:13,280 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 14:26:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:26:13,281 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:26:13,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:26:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 14:26:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 14:26:13,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:26:13,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:13,286 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:13,286 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:13,288 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 14:26:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 14:26:13,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:13,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:13,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:26:13,289 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-27 14:26:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:26:13,290 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 14:26:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 14:26:13,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:26:13,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:26:13,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:26:13,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:26:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:26:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-27 14:26:13,293 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-04-27 14:26:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:26:13,293 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-27 14:26:13,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 14:26:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-27 14:26:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 14:26:13,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:26:13,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:26:13,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 14:26:13,509 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 14:26:13,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:26:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:26:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-27 14:26:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:26:13,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556748465] [2022-04-27 14:26:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:26:13,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:26:13,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616129667] [2022-04-27 14:26:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:26:13,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:26:13,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:26:13,536 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 14:26:13,539 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 14:26:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:13,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 14:26:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:26:13,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:26:21,845 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-27 14:26:22,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2022-04-27 14:26:22,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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(13, 2);call #Ultimate.allocInit(12, 3); {580#true} is VALID [2022-04-27 14:26:22,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:22,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} #83#return; {580#true} is VALID [2022-04-27 14:26:22,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} call #t~ret6 := main(); {580#true} is VALID [2022-04-27 14:26:22,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {580#true} is VALID [2022-04-27 14:26:22,351 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:22,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-27 14:26:22,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-27 14:26:22,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:22,352 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} #71#return; {580#true} is VALID [2022-04-27 14:26:22,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {580#true} is VALID [2022-04-27 14:26:22,352 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:22,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-27 14:26:22,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-27 14:26:22,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:22,352 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} #73#return; {580#true} is VALID [2022-04-27 14:26:22,352 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:22,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} ~cond := #in~cond; {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:26:22,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:22,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:26:22,365 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {580#true} #75#return; {650#(<= 1 main_~y~0)} is VALID [2022-04-27 14:26:22,365 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-27 14:26:22,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-27 14:26:22,366 INFO L272 TraceCheckUtils]: 24: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:22,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} ~cond := #in~cond; {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:22,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:22,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:24,369 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-27 14:26:24,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= main_~a~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0))) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-27 14:26:24,371 INFO L272 TraceCheckUtils]: 30: Hoare triple {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:24,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:24,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-04-27 14:26:24,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-04-27 14:26:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 14:26:24,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:26:50,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-04-27 14:26:50,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-04-27 14:26:50,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:26:50,789 INFO L272 TraceCheckUtils]: 30: Hoare triple {703#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:26:50,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {707#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {703#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-27 14:26:50,809 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#true} #77#return; {707#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-27 14:26:50,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:50,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:26:50,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} ~cond := #in~cond; {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:26:50,811 INFO L272 TraceCheckUtils]: 24: Hoare triple {580#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:50,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {580#true} assume !false; {580#true} is VALID [2022-04-27 14:26:50,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {580#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {580#true} is VALID [2022-04-27 14:26:50,811 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {580#true} {580#true} #75#return; {580#true} is VALID [2022-04-27 14:26:50,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:50,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-27 14:26:50,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-27 14:26:50,812 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:50,812 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} #73#return; {580#true} is VALID [2022-04-27 14:26:50,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:50,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-27 14:26:50,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-27 14:26:50,812 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:50,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {580#true} is VALID [2022-04-27 14:26:50,812 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} #71#return; {580#true} is VALID [2022-04-27 14:26:50,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:50,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-27 14:26:50,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-27 14:26:50,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {580#true} is VALID [2022-04-27 14:26:50,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {580#true} is VALID [2022-04-27 14:26:50,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} call #t~ret6 := main(); {580#true} is VALID [2022-04-27 14:26:50,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} #83#return; {580#true} is VALID [2022-04-27 14:26:50,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-27 14:26:50,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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(13, 2);call #Ultimate.allocInit(12, 3); {580#true} is VALID [2022-04-27 14:26:50,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2022-04-27 14:26:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:26:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:26:50,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556748465] [2022-04-27 14:26:50,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:26:50,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616129667] [2022-04-27 14:26:50,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616129667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:26:50,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:26:50,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-27 14:26:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360330663] [2022-04-27 14:26:50,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:26:50,815 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-27 14:26:50,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:26:50,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:26:52,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 14:26:52,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 14:26:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:26:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 14:26:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:26:52,850 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:26:55,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:27:04,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:27:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:04,184 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 14:27:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 14:27:04,185 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-27 14:27:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:27:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-27 14:27:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:27:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 55 transitions. [2022-04-27 14:27:04,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 55 transitions. [2022-04-27 14:27:04,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:04,238 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:27:04,238 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 14:27:04,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-27 14:27:04,239 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:04,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 153 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-27 14:27:04,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 14:27:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-27 14:27:04,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:04,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,264 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,265 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:04,266 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 14:27:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 14:27:04,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:04,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:04,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-27 14:27:04,267 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-27 14:27:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:04,269 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 14:27:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-27 14:27:04,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:04,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:04,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:04,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 14:27:04,271 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 34 [2022-04-27 14:27:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:04,271 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 14:27:04,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:27:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 14:27:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 14:27:04,272 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:04,272 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 14:27:04,291 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 14:27:04,473 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 14:27:04,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:04,474 INFO L85 PathProgramCache]: Analyzing trace with hash -624978355, now seen corresponding path program 1 times [2022-04-27 14:27:04,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:04,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110847643] [2022-04-27 14:27:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:04,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103643979] [2022-04-27 14:27:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:04,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:04,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:04,508 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 14:27:04,509 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 14:27:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:04,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 14:27:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:04,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:04,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2022-04-27 14:27:04,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1016#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(13, 2);call #Ultimate.allocInit(12, 3); {1016#true} is VALID [2022-04-27 14:27:04,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:04,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1016#true} {1016#true} #83#return; {1016#true} is VALID [2022-04-27 14:27:04,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {1016#true} call #t~ret6 := main(); {1016#true} is VALID [2022-04-27 14:27:04,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {1016#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1016#true} is VALID [2022-04-27 14:27:04,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {1016#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:04,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1016#true} ~cond := #in~cond; {1042#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:04,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:04,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:04,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} {1016#true} #71#return; {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:27:04,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:27:04,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:04,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:04,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:04,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:04,932 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1016#true} {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:27:04,932 INFO L272 TraceCheckUtils]: 17: Hoare triple {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:04,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:04,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:04,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:04,933 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1016#true} {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 14:27:04,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {1053#(and (<= 0 main_~x~0) (<= main_~x~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1090#(<= 0 main_~a~0)} is VALID [2022-04-27 14:27:04,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {1090#(<= 0 main_~a~0)} assume !false; {1090#(<= 0 main_~a~0)} is VALID [2022-04-27 14:27:04,934 INFO L272 TraceCheckUtils]: 24: Hoare triple {1090#(<= 0 main_~a~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:04,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:04,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:04,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:04,935 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1016#true} {1090#(<= 0 main_~a~0)} #77#return; {1090#(<= 0 main_~a~0)} is VALID [2022-04-27 14:27:04,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {1090#(<= 0 main_~a~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:04,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:04,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:04,937 INFO L272 TraceCheckUtils]: 32: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:04,937 INFO L290 TraceCheckUtils]: 33: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:04,937 INFO L290 TraceCheckUtils]: 34: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:04,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:04,937 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1016#true} {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:04,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {1112#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L272 TraceCheckUtils]: 38: Hoare triple {1017#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {1017#false} ~cond := #in~cond; {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {1017#false} assume !(0 == ~cond); {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {1017#false} assume true; {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1017#false} {1017#false} #79#return; {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L272 TraceCheckUtils]: 43: Hoare triple {1017#false} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1017#false} is VALID [2022-04-27 14:27:04,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {1017#false} ~cond := #in~cond; {1017#false} is VALID [2022-04-27 14:27:04,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {1017#false} assume 0 == ~cond; {1017#false} is VALID [2022-04-27 14:27:04,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2022-04-27 14:27:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:27:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:27:05,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {1017#false} assume !false; {1017#false} is VALID [2022-04-27 14:27:05,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {1017#false} assume 0 == ~cond; {1017#false} is VALID [2022-04-27 14:27:05,927 INFO L290 TraceCheckUtils]: 44: Hoare triple {1017#false} ~cond := #in~cond; {1017#false} is VALID [2022-04-27 14:27:05,927 INFO L272 TraceCheckUtils]: 43: Hoare triple {1017#false} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1017#false} is VALID [2022-04-27 14:27:05,927 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1016#true} {1017#false} #79#return; {1017#false} is VALID [2022-04-27 14:27:05,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:05,927 INFO L290 TraceCheckUtils]: 40: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:05,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:05,928 INFO L272 TraceCheckUtils]: 38: Hoare triple {1017#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:05,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {1017#false} is VALID [2022-04-27 14:27:05,929 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1016#true} {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:05,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:05,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:05,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:05,929 INFO L272 TraceCheckUtils]: 32: Hoare triple {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:05,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:05,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {1213#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1191#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-27 14:27:05,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1213#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-27 14:27:05,932 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1016#true} {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-27 14:27:05,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:05,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:05,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:05,932 INFO L272 TraceCheckUtils]: 24: Hoare triple {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:05,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-27 14:27:05,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1217#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-27 14:27:05,934 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1016#true} {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #75#return; {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-27 14:27:05,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:05,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:05,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:05,938 INFO L272 TraceCheckUtils]: 17: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:05,939 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1016#true} {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #73#return; {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-27 14:27:05,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:05,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {1016#true} assume !(0 == ~cond); {1016#true} is VALID [2022-04-27 14:27:05,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {1016#true} ~cond := #in~cond; {1016#true} is VALID [2022-04-27 14:27:05,944 INFO L272 TraceCheckUtils]: 12: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:05,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-27 14:27:05,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} {1016#true} #71#return; {1239#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-27 14:27:05,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:05,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1285#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1046#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:05,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1016#true} ~cond := #in~cond; {1285#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 14:27:05,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {1016#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1016#true} is VALID [2022-04-27 14:27:05,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {1016#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1016#true} is VALID [2022-04-27 14:27:05,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {1016#true} call #t~ret6 := main(); {1016#true} is VALID [2022-04-27 14:27:05,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1016#true} {1016#true} #83#return; {1016#true} is VALID [2022-04-27 14:27:05,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#true} assume true; {1016#true} is VALID [2022-04-27 14:27:05,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1016#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(13, 2);call #Ultimate.allocInit(12, 3); {1016#true} is VALID [2022-04-27 14:27:05,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1016#true} call ULTIMATE.init(); {1016#true} is VALID [2022-04-27 14:27:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:27:05,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:05,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110847643] [2022-04-27 14:27:05,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:05,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103643979] [2022-04-27 14:27:05,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103643979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:27:05,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:27:05,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-04-27 14:27:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522532414] [2022-04-27 14:27:05,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:27:05,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-27 14:27:05,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:05,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 14:27:05,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:05,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 14:27:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 14:27:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:27:05,997 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 14:27:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:06,287 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 14:27:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:27:06,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-27 14:27:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 14:27:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-27 14:27:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 14:27:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-27 14:27:06,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-27 14:27:06,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:06,335 INFO L225 Difference]: With dead ends: 51 [2022-04-27 14:27:06,335 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 14:27:06,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-27 14:27:06,336 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:06,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:27:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 14:27:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-27 14:27:06,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:06,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:06,358 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:06,358 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:06,359 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 14:27:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 14:27:06,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:06,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:06,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-27 14:27:06,360 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-27 14:27:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:06,361 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 14:27:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-27 14:27:06,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:06,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:06,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:06,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 14:27:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 14:27:06,363 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 47 [2022-04-27 14:27:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:06,364 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 14:27:06,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 14:27:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 14:27:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 14:27:06,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:27:06,365 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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] [2022-04-27 14:27:06,381 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 14:27:06,580 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 14:27:06,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:27:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:27:06,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2091386113, now seen corresponding path program 1 times [2022-04-27 14:27:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:27:06,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357128574] [2022-04-27 14:27:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:06,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:27:06,594 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:27:06,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808148047] [2022-04-27 14:27:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:27:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:27:06,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:27:06,595 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 14:27:06,596 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 14:27:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:06,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:27:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:27:06,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:27:06,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {1526#true} call ULTIMATE.init(); {1526#true} is VALID [2022-04-27 14:27:06,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#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(13, 2);call #Ultimate.allocInit(12, 3); {1526#true} is VALID [2022-04-27 14:27:06,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:06,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} #83#return; {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {1526#true} call #t~ret6 := main(); {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {1526#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {1526#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1526#true} {1526#true} #71#return; {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {1526#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {1526#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:06,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#true} ~cond := #in~cond; {1570#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 14:27:06,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1570#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1574#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:06,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {1574#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1574#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 14:27:06,859 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1574#(not (= |assume_abort_if_not_#in~cond| 0))} {1526#true} #73#return; {1581#(and (<= 0 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 14:27:06,859 INFO L272 TraceCheckUtils]: 17: Hoare triple {1581#(and (<= 0 main_~y~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:06,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:06,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:06,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:06,859 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1526#true} {1581#(and (<= 0 main_~y~0) (<= main_~y~0 5))} #75#return; {1581#(and (<= 0 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-27 14:27:06,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {1581#(and (<= 0 main_~y~0) (<= main_~y~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1600#(<= 0 main_~b~0)} is VALID [2022-04-27 14:27:06,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {1600#(<= 0 main_~b~0)} assume !false; {1600#(<= 0 main_~b~0)} is VALID [2022-04-27 14:27:06,860 INFO L272 TraceCheckUtils]: 24: Hoare triple {1600#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:06,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:06,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:06,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:06,861 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1526#true} {1600#(<= 0 main_~b~0)} #77#return; {1600#(<= 0 main_~b~0)} is VALID [2022-04-27 14:27:06,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {1600#(<= 0 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,867 INFO L272 TraceCheckUtils]: 33: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:06,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:06,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:06,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:06,868 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1526#true} {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} #77#return; {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {1622#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,868 INFO L272 TraceCheckUtils]: 39: Hoare triple {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:06,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:06,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:06,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:06,869 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1526#true} {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #79#return; {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-27 14:27:06,870 INFO L272 TraceCheckUtils]: 44: Hoare triple {1650#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:06,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:06,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {1673#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1527#false} is VALID [2022-04-27 14:27:06,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {1527#false} assume !false; {1527#false} is VALID [2022-04-27 14:27:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 14:27:06,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:27:07,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {1527#false} assume !false; {1527#false} is VALID [2022-04-27 14:27:07,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {1673#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1527#false} is VALID [2022-04-27 14:27:07,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1673#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:27:07,101 INFO L272 TraceCheckUtils]: 44: Hoare triple {1689#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1669#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:27:07,102 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1526#true} {1689#(= (* main_~b~0 main_~a~0) 0)} #79#return; {1689#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-27 14:27:07,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:07,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:07,102 INFO L272 TraceCheckUtils]: 39: Hoare triple {1689#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:07,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {1526#true} assume !(0 != ~a~0 && 0 != ~b~0); {1689#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-27 14:27:07,104 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1526#true} {1526#true} #77#return; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L272 TraceCheckUtils]: 33: Hoare triple {1526#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {1526#true} assume !false; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {1526#true} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {1526#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {1526#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1526#true} {1526#true} #77#return; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 27: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 26: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L290 TraceCheckUtils]: 25: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:07,104 INFO L272 TraceCheckUtils]: 24: Hoare triple {1526#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {1526#true} assume !false; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {1526#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1526#true} {1526#true} #75#return; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {1526#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1526#true} {1526#true} #73#return; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L272 TraceCheckUtils]: 12: Hoare triple {1526#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {1526#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1526#true} {1526#true} #71#return; {1526#true} is VALID [2022-04-27 14:27:07,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1526#true} assume !(0 == ~cond); {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1526#true} ~cond := #in~cond; {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L272 TraceCheckUtils]: 6: Hoare triple {1526#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {1526#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {1526#true} call #t~ret6 := main(); {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} #83#return; {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1526#true} assume true; {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1526#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(13, 2);call #Ultimate.allocInit(12, 3); {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {1526#true} call ULTIMATE.init(); {1526#true} is VALID [2022-04-27 14:27:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-27 14:27:07,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:27:07,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357128574] [2022-04-27 14:27:07,107 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:27:07,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808148047] [2022-04-27 14:27:07,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808148047] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:27:07,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:27:07,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-27 14:27:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536023520] [2022-04-27 14:27:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:27:07,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-27 14:27:07,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:27:07,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:27:07,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:07,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:27:07,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:27:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:27:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:27:07,129 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:27:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:07,460 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-27 14:27:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:27:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-27 14:27:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:27:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:27:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 14:27:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:27:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 14:27:07,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 14:27:07,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:27:07,493 INFO L225 Difference]: With dead ends: 38 [2022-04-27 14:27:07,493 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:27:07,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 14:27:07,494 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:27:07,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:27:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:27:07,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:27:07,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:27:07,495 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 14:27:07,495 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 14:27:07,495 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 14:27:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:07,495 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:27:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:27:07,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:07,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:07,496 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 14:27:07,496 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 14:27:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:27:07,496 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:27:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:27:07,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:07,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:27:07,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:27:07,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:27:07,496 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 14:27:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:27:07,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-27 14:27:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:27:07,496 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:27:07,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 14:27:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:27:07,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:27:07,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:27:07,517 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 14:27:07,699 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 14:27:07,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:27:08,011 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:27:08,011 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:27:08,011 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:27:08,011 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-27 14:27:08,011 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 60) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 60) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-27 14:27:08,012 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-27 14:27:08,012 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 5)) [2022-04-27 14:27:08,012 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 5)) [2022-04-27 14:27:08,012 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-27 14:27:08,012 INFO L902 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2022-04-27 14:27:08,012 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= main_~x~0 5) (<= 0 main_~a~0) (<= 1 main_~y~0)) [2022-04-27 14:27:08,012 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= main_~x~0 5) (<= 0 main_~a~0) (<= 1 main_~y~0)) [2022-04-27 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2022-04-27 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:27:08,013 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 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:27:08,013 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 14:27:08,013 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:27:08,013 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:27:08,013 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:27:08,014 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:27:08,014 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:27:08,014 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:27:08,016 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 14:27:08,017 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:27:08,022 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:27:08,023 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-27 14:27:08,024 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:27:08,025 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:27:08,025 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 14:27:08,025 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 14:27:08,028 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 14:27:08,028 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:27:08,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:27:08 BoogieIcfgContainer [2022-04-27 14:27:08,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:27:08,035 INFO L158 Benchmark]: Toolchain (without parser) took 56981.10ms. Allocated memory was 205.5MB in the beginning and 280.0MB in the end (delta: 74.4MB). Free memory was 151.0MB in the beginning and 107.5MB in the end (delta: 43.5MB). Peak memory consumption was 118.7MB. Max. memory is 8.0GB. [2022-04-27 14:27:08,036 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 205.5MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:27:08,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.22ms. Allocated memory was 205.5MB in the beginning and 280.0MB in the end (delta: 74.4MB). Free memory was 150.8MB in the beginning and 252.1MB in the end (delta: -101.3MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-04-27 14:27:08,037 INFO L158 Benchmark]: Boogie Preprocessor took 39.20ms. Allocated memory is still 280.0MB. Free memory was 252.1MB in the beginning and 250.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 14:27:08,037 INFO L158 Benchmark]: RCFGBuilder took 305.41ms. Allocated memory is still 280.0MB. Free memory was 250.5MB in the beginning and 236.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 14:27:08,037 INFO L158 Benchmark]: TraceAbstraction took 56426.89ms. Allocated memory is still 280.0MB. Free memory was 235.8MB in the beginning and 107.5MB in the end (delta: 128.3MB). Peak memory consumption was 128.8MB. Max. memory is 8.0GB. [2022-04-27 14:27:08,039 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.09ms. Allocated memory is still 205.5MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.22ms. Allocated memory was 205.5MB in the beginning and 280.0MB in the end (delta: 74.4MB). Free memory was 150.8MB in the beginning and 252.1MB in the end (delta: -101.3MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.20ms. Allocated memory is still 280.0MB. Free memory was 252.1MB in the beginning and 250.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 305.41ms. Allocated memory is still 280.0MB. Free memory was 250.5MB in the beginning and 236.3MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 56426.89ms. Allocated memory is still 280.0MB. Free memory was 235.8MB in the beginning and 107.5MB in the end (delta: 128.3MB). Peak memory consumption was 128.8MB. 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: 14]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.4s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 512 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 439 IncrementalHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 140 mSDtfsCounter, 439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 279 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 27 PreInvPairs, 37 NumberOfFragments, 119 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 314 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 39.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 957 SizeOfPredicates, 18 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 173/196 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: 34]: Loop Invariant Derived loop invariant: (((0 <= x && q + b * a * p == y * x) && x <= 5) && 0 <= a) && 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-27 14:27:08,059 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...