/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:30:00,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:30:00,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:30:00,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:30:00,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:30:00,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:30:00,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:30:00,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:30:00,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:30:00,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:30:00,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:30:00,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:30:00,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:30:00,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:30:00,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:30:00,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:30:00,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:30:00,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:30:00,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:30:00,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:30:00,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:30:00,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:30:00,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:30:00,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:30:00,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:30:00,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:30:00,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:30:00,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:30:00,585 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:30:00,586 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:30:00,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:30:00,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:30:00,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:30:00,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:30:00,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:30:00,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:30:00,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:30:00,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:30:00,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:30:00,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:30:00,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:30:00,600 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 [2020-07-10 15:30:00,624 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:30:00,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:30:00,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:30:00,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:30:00,626 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:30:00,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:30:00,626 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:30:00,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:30:00,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:30:00,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:30:00,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:30:00,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:30:00,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:30:00,628 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:30:00,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:30:00,628 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:30:00,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:30:00,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:30:00,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:30:00,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:30:00,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:30:00,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:00,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:30:00,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:30:00,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:30:00,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:30:00,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:30:00,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:30:00,631 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:30:00,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:30:00,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:30:00,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:30:00,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:30:00,935 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:30:00,935 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:30:00,936 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo1.c [2020-07-10 15:30:01,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa13e5491/e58c5562dcf046f2993dc4b156b2bdb8/FLAG727864daa [2020-07-10 15:30:01,487 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:30:01,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo1.c [2020-07-10 15:30:01,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa13e5491/e58c5562dcf046f2993dc4b156b2bdb8/FLAG727864daa [2020-07-10 15:30:01,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa13e5491/e58c5562dcf046f2993dc4b156b2bdb8 [2020-07-10 15:30:01,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:30:01,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:30:01,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:01,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:30:01,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:30:01,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbfc568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:01, skipping insertion in model container [2020-07-10 15:30:01,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:01" (1/1) ... [2020-07-10 15:30:01,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:01,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:02,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:02,150 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:02,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:02,188 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:02,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02 WrapperNode [2020-07-10 15:30:02,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:02,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:02,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:02,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:02,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... [2020-07-10 15:30:02,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:02,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:02,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:02,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:02,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:02,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:02,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:02,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:30:02,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:02,384 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:30:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:30:02,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:30:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:02,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:02,668 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:02,668 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:30:02,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:02 BoogieIcfgContainer [2020-07-10 15:30:02,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:02,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:02,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:02,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:02,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:30:01" (1/3) ... [2020-07-10 15:30:02,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfe4323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:02, skipping insertion in model container [2020-07-10 15:30:02,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:02" (2/3) ... [2020-07-10 15:30:02,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfe4323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:02, skipping insertion in model container [2020-07-10 15:30:02,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:02" (3/3) ... [2020-07-10 15:30:02,686 INFO L109 eAbstractionObserver]: Analyzing ICFG geo1.c [2020-07-10 15:30:02,702 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:02,710 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:02,730 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:02,761 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:02,762 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:02,762 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:02,762 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:02,762 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:02,762 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:02,762 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:02,763 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 15:30:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:02,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:02,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:02,799 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1923958992, now seen corresponding path program 1 times [2020-07-10 15:30:02,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:02,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376280273] [2020-07-10 15:30:02,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:02,936 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:02,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683836155] [2020-07-10 15:30:02,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:30:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:03,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:03,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 15:30:03,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:30:03,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #47#return; {24#true} is VALID [2020-07-10 15:30:03,183 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2020-07-10 15:30:03,186 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {41#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:03,188 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} assume !false; {41#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:03,190 INFO L263 TraceCheckUtils]: 6: Hoare triple {41#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {48#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:03,192 INFO L280 TraceCheckUtils]: 7: Hoare triple {48#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {52#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:03,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {52#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25#false} is VALID [2020-07-10 15:30:03,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 15:30:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:03,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376280273] [2020-07-10 15:30:03,199 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:03,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683836155] [2020-07-10 15:30:03,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:03,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:30:03,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891561301] [2020-07-10 15:30:03,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:03,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:03,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:30:03,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:03,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:30:03,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:03,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:30:03,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:30:03,263 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-10 15:30:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:03,543 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2020-07-10 15:30:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:30:03,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-10 15:30:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2020-07-10 15:30:03,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2020-07-10 15:30:03,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:03,748 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:30:03,748 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 15:30:03,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 15:30:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-10 15:30:03,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:03,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2020-07-10 15:30:03,831 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2020-07-10 15:30:03,831 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2020-07-10 15:30:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:03,837 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-10 15:30:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 15:30:03,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:03,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:03,838 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2020-07-10 15:30:03,839 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2020-07-10 15:30:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:03,842 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-10 15:30:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-10 15:30:03,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:03,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:03,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:03,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:30:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-10 15:30:03,849 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-10 15:30:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:03,850 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-10 15:30:03,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:30:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:30:03,851 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:03,852 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:04,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2020-07-10 15:30:04,053 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1187633082, now seen corresponding path program 1 times [2020-07-10 15:30:04,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:04,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534346491] [2020-07-10 15:30:04,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:04,063 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:04,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241095935] [2020-07-10 15:30:04,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,112 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:30:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:04,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:04,437 INFO L263 TraceCheckUtils]: 0: Hoare triple {201#true} call ULTIMATE.init(); {201#true} is VALID [2020-07-10 15:30:04,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {201#true} assume true; {201#true} is VALID [2020-07-10 15:30:04,438 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {201#true} {201#true} #47#return; {201#true} is VALID [2020-07-10 15:30:04,438 INFO L263 TraceCheckUtils]: 3: Hoare triple {201#true} call #t~ret2 := main(); {201#true} is VALID [2020-07-10 15:30:04,439 INFO L280 TraceCheckUtils]: 4: Hoare triple {201#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {201#true} is VALID [2020-07-10 15:30:04,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {201#true} assume !false; {201#true} is VALID [2020-07-10 15:30:04,440 INFO L263 TraceCheckUtils]: 6: Hoare triple {201#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {201#true} is VALID [2020-07-10 15:30:04,441 INFO L280 TraceCheckUtils]: 7: Hoare triple {201#true} ~cond := #in~cond; {227#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:04,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {231#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:04,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {231#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:04,445 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {231#(not (= 0 |__VERIFIER_assert_#in~cond|))} {201#true} #51#return; {238#(= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1))} is VALID [2020-07-10 15:30:04,446 INFO L280 TraceCheckUtils]: 11: Hoare triple {238#(= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1))} assume !(~c~0 < ~k~0); {238#(= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1))} is VALID [2020-07-10 15:30:06,478 INFO L280 TraceCheckUtils]: 12: Hoare triple {238#(= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1))} ~x~0 := ~x~0 * (~z~0 - 1); {245#(exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (and (= (* v_main_~x~0_12 main_~z~0) (+ main_~x~0 v_main_~x~0_12)) (= (+ main_~y~0 v_main_~x~0_12) (+ (* v_main_~x~0_12 main_~z~0) 1))))} is UNKNOWN [2020-07-10 15:30:06,483 INFO L263 TraceCheckUtils]: 13: Hoare triple {245#(exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (and (= (* v_main_~x~0_12 main_~z~0) (+ main_~x~0 v_main_~x~0_12)) (= (+ main_~y~0 v_main_~x~0_12) (+ (* v_main_~x~0_12 main_~z~0) 1))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:06,484 INFO L280 TraceCheckUtils]: 14: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:06,485 INFO L280 TraceCheckUtils]: 15: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {202#false} is VALID [2020-07-10 15:30:06,485 INFO L280 TraceCheckUtils]: 16: Hoare triple {202#false} assume !false; {202#false} is VALID [2020-07-10 15:30:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:06,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534346491] [2020-07-10 15:30:06,490 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:06,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241095935] [2020-07-10 15:30:06,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:06,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:30:06,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023939900] [2020-07-10 15:30:06,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-10 15:30:06,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:06,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:30:06,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:06,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:30:06,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:06,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:30:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:06,556 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2020-07-10 15:30:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:11,110 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:30:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:30:11,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-07-10 15:30:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-10 15:30:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-10 15:30:11,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-10 15:30:11,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:11,228 INFO L225 Difference]: With dead ends: 28 [2020-07-10 15:30:11,228 INFO L226 Difference]: Without dead ends: 20 [2020-07-10 15:30:11,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:30:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-10 15:30:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-10 15:30:11,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:11,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-10 15:30:11,250 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:30:11,251 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:30:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:11,256 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:30:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:30:11,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:11,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:11,259 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-10 15:30:11,259 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-10 15:30:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:11,263 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:30:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:30:11,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:11,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:11,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:11,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:30:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-10 15:30:11,270 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2020-07-10 15:30:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:11,271 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-10 15:30:11,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:30:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-10 15:30:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:30:11,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:11,272 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:11,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:11,474 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1235596592, now seen corresponding path program 1 times [2020-07-10 15:30:11,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:11,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986380529] [2020-07-10 15:30:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:11,488 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:11,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958832324] [2020-07-10 15:30:11,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:11,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 15:30:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:30:13,572 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:13,725 INFO L263 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2020-07-10 15:30:13,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#true} assume true; {373#true} is VALID [2020-07-10 15:30:13,726 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {373#true} {373#true} #47#return; {373#true} is VALID [2020-07-10 15:30:13,726 INFO L263 TraceCheckUtils]: 3: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2020-07-10 15:30:13,727 INFO L280 TraceCheckUtils]: 4: Hoare triple {373#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:13,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} assume !false; {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:13,729 INFO L263 TraceCheckUtils]: 6: Hoare triple {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {373#true} is VALID [2020-07-10 15:30:13,729 INFO L280 TraceCheckUtils]: 7: Hoare triple {373#true} ~cond := #in~cond; {373#true} is VALID [2020-07-10 15:30:13,729 INFO L280 TraceCheckUtils]: 8: Hoare triple {373#true} assume !(0 == ~cond); {373#true} is VALID [2020-07-10 15:30:13,730 INFO L280 TraceCheckUtils]: 9: Hoare triple {373#true} assume true; {373#true} is VALID [2020-07-10 15:30:13,731 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {373#true} {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} #51#return; {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} is VALID [2020-07-10 15:30:13,732 INFO L280 TraceCheckUtils]: 11: Hoare triple {390#(and (= 1 main_~x~0) (= main_~z~0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {412#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-10 15:30:13,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {412#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !false; {412#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-10 15:30:15,782 INFO L263 TraceCheckUtils]: 13: Hoare triple {412#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~y~0 (* main_~z~0 main_~z~0)))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {419#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-10 15:30:15,783 INFO L280 TraceCheckUtils]: 14: Hoare triple {419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:15,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {374#false} is VALID [2020-07-10 15:30:15,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {374#false} assume !false; {374#false} is VALID [2020-07-10 15:30:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:15,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986380529] [2020-07-10 15:30:15,787 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:15,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958832324] [2020-07-10 15:30:15,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:15,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:30:15,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859100788] [2020-07-10 15:30:15,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:15,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:15,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:30:17,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:17,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:30:17,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:30:17,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:17,961 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 6 states. [2020-07-10 15:30:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:22,392 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-10 15:30:22,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:30:22,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:22,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-10 15:30:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2020-07-10 15:30:22,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2020-07-10 15:30:24,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:24,470 INFO L225 Difference]: With dead ends: 30 [2020-07-10 15:30:24,470 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:30:24,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:24,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:30:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 15:30:24,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:24,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 15:30:24,491 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 15:30:24,491 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 15:30:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:24,494 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:30:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 15:30:24,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:24,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:24,495 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 15:30:24,496 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 15:30:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:24,498 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 15:30:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 15:30:24,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:24,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:24,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:24,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:30:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-10 15:30:24,502 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2020-07-10 15:30:24,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:24,502 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-10 15:30:24,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:30:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 15:30:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:30:24,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:24,504 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:24,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:24,717 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash -677841104, now seen corresponding path program 2 times [2020-07-10 15:30:24,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:24,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120166225] [2020-07-10 15:30:24,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:24,726 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:24,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275013480] [2020-07-10 15:30:24,727 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:24,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:30:24,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:30:24,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-10 15:30:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:30:26,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:29,198 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:30:31,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {570#true} call ULTIMATE.init(); {570#true} is VALID [2020-07-10 15:30:31,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {570#true} assume true; {570#true} is VALID [2020-07-10 15:30:31,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {570#true} {570#true} #47#return; {570#true} is VALID [2020-07-10 15:30:31,457 INFO L263 TraceCheckUtils]: 3: Hoare triple {570#true} call #t~ret2 := main(); {570#true} is VALID [2020-07-10 15:30:31,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {570#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {587#(= main_~z~0 main_~y~0)} is VALID [2020-07-10 15:30:31,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {587#(= main_~z~0 main_~y~0)} assume !false; {587#(= main_~z~0 main_~y~0)} is VALID [2020-07-10 15:30:31,459 INFO L263 TraceCheckUtils]: 6: Hoare triple {587#(= main_~z~0 main_~y~0)} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {570#true} is VALID [2020-07-10 15:30:31,459 INFO L280 TraceCheckUtils]: 7: Hoare triple {570#true} ~cond := #in~cond; {570#true} is VALID [2020-07-10 15:30:31,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {570#true} assume !(0 == ~cond); {570#true} is VALID [2020-07-10 15:30:31,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {570#true} assume true; {570#true} is VALID [2020-07-10 15:30:31,468 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {570#true} {587#(= main_~z~0 main_~y~0)} #51#return; {587#(= main_~z~0 main_~y~0)} is VALID [2020-07-10 15:30:31,469 INFO L280 TraceCheckUtils]: 11: Hoare triple {587#(= main_~z~0 main_~y~0)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {609#(= main_~y~0 (* main_~z~0 main_~z~0))} is VALID [2020-07-10 15:30:31,471 INFO L280 TraceCheckUtils]: 12: Hoare triple {609#(= main_~y~0 (* main_~z~0 main_~z~0))} assume !false; {609#(= main_~y~0 (* main_~z~0 main_~z~0))} is VALID [2020-07-10 15:30:31,471 INFO L263 TraceCheckUtils]: 13: Hoare triple {609#(= main_~y~0 (* main_~z~0 main_~z~0))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {570#true} is VALID [2020-07-10 15:30:31,472 INFO L280 TraceCheckUtils]: 14: Hoare triple {570#true} ~cond := #in~cond; {619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:31,473 INFO L280 TraceCheckUtils]: 15: Hoare triple {619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {623#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:31,473 INFO L280 TraceCheckUtils]: 16: Hoare triple {623#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {623#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:31,475 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {623#(not (= 0 |__VERIFIER_assert_#in~cond|))} {609#(= main_~y~0 (* main_~z~0 main_~z~0))} #51#return; {630#(and (= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1)) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-10 15:30:33,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {630#(and (= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1)) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {634#(exists ((v_main_~x~0_14 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_14) 1) (+ (* main_~z~0 main_~z~0) v_main_~x~0_14)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) 1)) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_14)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_14)))))} is UNKNOWN [2020-07-10 15:30:33,502 INFO L280 TraceCheckUtils]: 19: Hoare triple {634#(exists ((v_main_~x~0_14 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_14) 1) (+ (* main_~z~0 main_~z~0) v_main_~x~0_14)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) 1)) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_14)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_14)))))} assume !false; {634#(exists ((v_main_~x~0_14 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_14) 1) (+ (* main_~z~0 main_~z~0) v_main_~x~0_14)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) 1)) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_14)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_14)))))} is VALID [2020-07-10 15:30:35,541 INFO L263 TraceCheckUtils]: 20: Hoare triple {634#(exists ((v_main_~x~0_14 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_14) 1) (+ (* main_~z~0 main_~z~0) v_main_~x~0_14)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_14) 1)) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_14)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_14)))))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {641#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-10 15:30:35,542 INFO L280 TraceCheckUtils]: 21: Hoare triple {641#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {645#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:35,543 INFO L280 TraceCheckUtils]: 22: Hoare triple {645#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {571#false} is VALID [2020-07-10 15:30:35,543 INFO L280 TraceCheckUtils]: 23: Hoare triple {571#false} assume !false; {571#false} is VALID [2020-07-10 15:30:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:30:35,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120166225] [2020-07-10 15:30:35,546 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:35,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275013480] [2020-07-10 15:30:35,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:35,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-10 15:30:35,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883754453] [2020-07-10 15:30:35,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:30:35,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:35,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:30:39,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 22 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:39,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:30:39,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:39,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:30:39,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:30:39,692 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2020-07-10 15:30:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:54,347 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-10 15:30:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:30:54,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-10 15:30:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:30:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-10 15:30:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:30:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-10 15:30:54,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-10 15:31:00,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 29 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:31:00,359 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:31:00,360 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:31:00,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:31:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:31:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-10 15:31:00,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:31:00,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-10 15:31:00,398 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-10 15:31:00,398 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-10 15:31:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:00,401 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 15:31:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 15:31:00,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:00,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:31:00,403 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-10 15:31:00,403 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-10 15:31:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:00,405 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-10 15:31:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-10 15:31:00,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:00,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:31:00,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:31:00,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:31:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:31:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-10 15:31:00,409 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-10 15:31:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:31:00,410 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-10 15:31:00,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:31:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 15:31:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:31:00,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:31:00,411 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:31:00,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:31:00,625 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:31:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:31:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1339520304, now seen corresponding path program 3 times [2020-07-10 15:31:00,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:31:00,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271270745] [2020-07-10 15:31:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:31:00,634 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:31:00,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398149826] [2020-07-10 15:31:00,635 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:31:00,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:31:00,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:31:00,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:31:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:31:02,710 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:31:06,481 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:31:08,732 INFO L263 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2020-07-10 15:31:08,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {828#true} assume true; {828#true} is VALID [2020-07-10 15:31:08,733 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {828#true} {828#true} #47#return; {828#true} is VALID [2020-07-10 15:31:08,733 INFO L263 TraceCheckUtils]: 3: Hoare triple {828#true} call #t~ret2 := main(); {828#true} is VALID [2020-07-10 15:31:08,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {828#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {828#true} is VALID [2020-07-10 15:31:08,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {828#true} assume !false; {828#true} is VALID [2020-07-10 15:31:08,734 INFO L263 TraceCheckUtils]: 6: Hoare triple {828#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {828#true} is VALID [2020-07-10 15:31:08,734 INFO L280 TraceCheckUtils]: 7: Hoare triple {828#true} ~cond := #in~cond; {828#true} is VALID [2020-07-10 15:31:08,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {828#true} assume !(0 == ~cond); {828#true} is VALID [2020-07-10 15:31:08,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {828#true} assume true; {828#true} is VALID [2020-07-10 15:31:08,734 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {828#true} {828#true} #51#return; {828#true} is VALID [2020-07-10 15:31:08,735 INFO L280 TraceCheckUtils]: 11: Hoare triple {828#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {828#true} is VALID [2020-07-10 15:31:08,735 INFO L280 TraceCheckUtils]: 12: Hoare triple {828#true} assume !false; {828#true} is VALID [2020-07-10 15:31:08,735 INFO L263 TraceCheckUtils]: 13: Hoare triple {828#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {828#true} is VALID [2020-07-10 15:31:08,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {828#true} ~cond := #in~cond; {828#true} is VALID [2020-07-10 15:31:08,736 INFO L280 TraceCheckUtils]: 15: Hoare triple {828#true} assume !(0 == ~cond); {828#true} is VALID [2020-07-10 15:31:08,736 INFO L280 TraceCheckUtils]: 16: Hoare triple {828#true} assume true; {828#true} is VALID [2020-07-10 15:31:08,736 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {828#true} {828#true} #51#return; {828#true} is VALID [2020-07-10 15:31:08,737 INFO L280 TraceCheckUtils]: 18: Hoare triple {828#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {828#true} is VALID [2020-07-10 15:31:08,737 INFO L280 TraceCheckUtils]: 19: Hoare triple {828#true} assume !false; {828#true} is VALID [2020-07-10 15:31:08,737 INFO L263 TraceCheckUtils]: 20: Hoare triple {828#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {828#true} is VALID [2020-07-10 15:31:08,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {828#true} ~cond := #in~cond; {896#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:31:08,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {896#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {900#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:31:08,745 INFO L280 TraceCheckUtils]: 23: Hoare triple {900#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {900#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:31:08,747 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {900#(not (= 0 |__VERIFIER_assert_#in~cond|))} {828#true} #51#return; {907#(= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1))} is VALID [2020-07-10 15:31:10,794 INFO L280 TraceCheckUtils]: 25: Hoare triple {907#(= (+ main_~y~0 main_~x~0) (+ (* main_~x~0 main_~z~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {911#(exists ((v_main_~x~0_15 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_15) 1) main_~x~0) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_15)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_15)))))} is UNKNOWN [2020-07-10 15:31:10,796 INFO L280 TraceCheckUtils]: 26: Hoare triple {911#(exists ((v_main_~x~0_15 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_15) 1) main_~x~0) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_15)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_15)))))} assume !false; {911#(exists ((v_main_~x~0_15 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_15) 1) main_~x~0) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_15)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_15)))))} is VALID [2020-07-10 15:31:12,849 INFO L263 TraceCheckUtils]: 27: Hoare triple {911#(exists ((v_main_~x~0_15 Int)) (and (= (+ (* main_~z~0 v_main_~x~0_15) 1) main_~x~0) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_15)) (+ main_~y~0 (* main_~z~0 v_main_~x~0_15)))))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {918#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-10 15:31:12,850 INFO L280 TraceCheckUtils]: 28: Hoare triple {918#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {922#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:31:12,851 INFO L280 TraceCheckUtils]: 29: Hoare triple {922#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {829#false} is VALID [2020-07-10 15:31:12,852 INFO L280 TraceCheckUtils]: 30: Hoare triple {829#false} assume !false; {829#false} is VALID [2020-07-10 15:31:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-10 15:31:12,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271270745] [2020-07-10 15:31:12,854 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:31:12,854 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398149826] [2020-07-10 15:31:12,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:31:12,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:31:12,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041444090] [2020-07-10 15:31:12,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-10 15:31:12,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:31:12,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:31:17,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:31:17,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:31:17,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:31:17,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:31:17,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2020-07-10 15:31:17,076 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 8 states. [2020-07-10 15:31:21,696 WARN L193 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 19 [2020-07-10 15:31:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:35,965 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 15:31:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:31:35,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-07-10 15:31:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:31:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:31:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-10 15:31:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:31:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-10 15:31:35,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2020-07-10 15:31:41,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 15 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2020-07-10 15:31:41,658 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:31:41,658 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:31:41,659 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=24, Invalid=64, Unknown=2, NotChecked=0, Total=90 [2020-07-10 15:31:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:31:41,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:31:41,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:31:41,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:31:41,660 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:31:41,660 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:31:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:41,661 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:31:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:31:41,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:41,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:31:41,661 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:31:41,661 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:31:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:31:41,662 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:31:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:31:41,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:41,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:31:41,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:31:41,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:31:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:31:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:31:41,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-10 15:31:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:31:41,663 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:31:41,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:31:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:31:41,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:31:41,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:31:41,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:31:41,948 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:31:41,948 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:31:41,948 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:31:41,948 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:31:41,949 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:31:41,949 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:31:41,949 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 10 12) no Hoare annotation was computed. [2020-07-10 15:31:41,949 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-10 15:31:41,949 INFO L268 CegarLoopResult]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2020-07-10 15:31:41,949 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2020-07-10 15:31:41,949 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (exists ((v_main_~x~0_15 Int)) (let ((.cse0 (* main_~z~0 v_main_~x~0_15))) (and (= main_~x~0 (+ .cse0 1)) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_15)) (+ main_~y~0 .cse0))))) [2020-07-10 15:31:41,949 INFO L268 CegarLoopResult]: For program point L31-1(lines 30 40) no Hoare annotation was computed. [2020-07-10 15:31:41,950 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 20 46) the Hoare annotation is: true [2020-07-10 15:31:41,950 INFO L264 CegarLoopResult]: At program point L30-2(lines 30 40) the Hoare annotation is: (exists ((v_main_~x~0_15 Int)) (let ((.cse0 (* main_~z~0 v_main_~x~0_15))) (and (= main_~x~0 (+ .cse0 1)) (= (+ main_~z~0 (* main_~z~0 main_~z~0 v_main_~x~0_15)) (+ main_~y~0 .cse0))))) [2020-07-10 15:31:41,950 INFO L268 CegarLoopResult]: For program point L30-3(lines 30 40) no Hoare annotation was computed. [2020-07-10 15:31:41,950 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 46) no Hoare annotation was computed. [2020-07-10 15:31:41,950 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 46) no Hoare annotation was computed. [2020-07-10 15:31:41,950 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (exists ((v_main_~x~0_12 Int) (main_~z~0 Int)) (let ((.cse0 (* v_main_~x~0_12 main_~z~0))) (and (= .cse0 (+ main_~x~0 v_main_~x~0_12)) (= (+ main_~y~0 v_main_~x~0_12) (+ .cse0 1))))) [2020-07-10 15:31:41,951 INFO L268 CegarLoopResult]: For program point L44-1(line 44) no Hoare annotation was computed. [2020-07-10 15:31:41,951 INFO L268 CegarLoopResult]: For program point L15(lines 15 16) no Hoare annotation was computed. [2020-07-10 15:31:41,951 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2020-07-10 15:31:41,951 INFO L268 CegarLoopResult]: For program point L14(lines 14 17) no Hoare annotation was computed. [2020-07-10 15:31:41,951 INFO L268 CegarLoopResult]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2020-07-10 15:31:41,951 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2020-07-10 15:31:41,951 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-07-10 15:31:41,956 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:31:41,957 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:31:41,970 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:31:41,970 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:31:41,970 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:31:41,970 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:31:41,970 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:31:41,971 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:31:41,971 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:31:41,972 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:31:41,973 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:31:41,974 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:31:41,975 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:31:41,975 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:31:41,975 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:31:41,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:41,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:41,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:41,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:41,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:41,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:41,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:31:41 BoogieIcfgContainer [2020-07-10 15:31:41,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:31:41,992 INFO L168 Benchmark]: Toolchain (without parser) took 100075.34 ms. Allocated memory was 136.8 MB in the beginning and 252.2 MB in the end (delta: 115.3 MB). Free memory was 101.2 MB in the beginning and 125.7 MB in the end (delta: -24.6 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:31:41,993 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:31:41,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.96 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:31:41,995 INFO L168 Benchmark]: Boogie Preprocessor took 116.29 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 91.1 MB in the beginning and 179.9 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:31:41,996 INFO L168 Benchmark]: RCFGBuilder took 368.33 ms. Allocated memory is still 200.3 MB. Free memory was 179.9 MB in the beginning and 162.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:31:41,997 INFO L168 Benchmark]: TraceAbstraction took 99314.41 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 162.1 MB in the beginning and 125.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:31:42,001 INFO L336 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.23 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.96 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 91.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.29 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 91.1 MB in the beginning and 179.9 MB in the end (delta: -88.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.33 ms. Allocated memory is still 200.3 MB. Free memory was 179.9 MB in the beginning and 162.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 99314.41 ms. Allocated memory was 200.3 MB in the beginning and 252.2 MB in the end (delta: 51.9 MB). Free memory was 162.1 MB in the beginning and 125.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-07-10 15:31:42,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:42,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:42,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:42,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:42,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] [2020-07-10 15:31:42,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_15,QUANTIFIED] Derived loop invariant: (\exists v_main_~x~0_15 : int :: x == z * v_main_~x~0_15 + 1 && z + z * z * v_main_~x~0_15 == y + z * v_main_~x~0_15) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 99.1s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 56.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 65 SDtfs, 42 SDslu, 254 SDs, 0 SdLazy, 193 SolverSat, 9 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, 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, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 23 NumberOfFragments, 65 HoareAnnotationTreeSize, 14 FomulaSimplifications, 248 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 99 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 94 ConstructedInterpolants, 5 QuantifiedInterpolants, 7704 SizeOfPredicates, 16 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 42/54 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...