/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/mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:30:02,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:30:02,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:30:02,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:30:02,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:30:02,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:30:02,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:30:02,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:30:02,144 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:30:02,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:30:02,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:30:02,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:30:02,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:30:02,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:30:02,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:30:02,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:30:02,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:30:02,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:30:02,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:30:02,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:30:02,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:30:02,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:30:02,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:30:02,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:30:02,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:30:02,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:30:02,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:30:02,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:30:02,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:30:02,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:30:02,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:30:02,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:30:02,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:30:02,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:30:02,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:30:02,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:30:02,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:30:02,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:30:02,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:30:02,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:30:02,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:30:02,192 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:02,229 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:30:02,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:30:02,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:30:02,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:30:02,231 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:30:02,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:30:02,232 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:30:02,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:30:02,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:30:02,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:30:02,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:30:02,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:30:02,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:30:02,233 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:30:02,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:30:02,235 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:30:02,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:30:02,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:30:02,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:30:02,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:30:02,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:30:02,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:02,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:30:02,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:30:02,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:30:02,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:30:02,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:30:02,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:30:02,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:30:02,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:30:02,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:30:02,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:30:02,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:30:02,528 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:30:02,529 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:30:02,529 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/mannadiv.c [2020-07-10 15:30:02,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2b9ac07/5c8e2825167e4ca4b04c4155d3cf8905/FLAG6f72d3699 [2020-07-10 15:30:03,057 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:30:03,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c [2020-07-10 15:30:03,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2b9ac07/5c8e2825167e4ca4b04c4155d3cf8905/FLAG6f72d3699 [2020-07-10 15:30:03,427 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d2b9ac07/5c8e2825167e4ca4b04c4155d3cf8905 [2020-07-10 15:30:03,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:30:03,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:30:03,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:03,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:30:03,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:30:03,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612941dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03, skipping insertion in model container [2020-07-10 15:30:03,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:03" (1/1) ... [2020-07-10 15:30:03,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:03,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:03,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:03,650 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:03,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:03,685 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:03,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03 WrapperNode [2020-07-10 15:30:03,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:03,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:03,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:03,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:03,699 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:03" (1/1) ... [2020-07-10 15:30:03,700 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:03" (1/1) ... [2020-07-10 15:30:03,705 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:03" (1/1) ... [2020-07-10 15:30:03,706 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:03" (1/1) ... [2020-07-10 15:30:03,711 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:03" (1/1) ... [2020-07-10 15:30:03,717 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:03" (1/1) ... [2020-07-10 15:30:03,718 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:03" (1/1) ... [2020-07-10 15:30:03,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:03,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:03,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:03,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:03,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (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:03,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:03,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:03,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:30:03,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:03,872 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:03,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:03,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:30:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:30:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:30:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:04,126 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:04,127 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:30:04,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:04 BoogieIcfgContainer [2020-07-10 15:30:04,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:04,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:04,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:04,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:04,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:30:03" (1/3) ... [2020-07-10 15:30:04,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28772e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:04, skipping insertion in model container [2020-07-10 15:30:04,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:03" (2/3) ... [2020-07-10 15:30:04,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28772e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:04, skipping insertion in model container [2020-07-10 15:30:04,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:04" (3/3) ... [2020-07-10 15:30:04,139 INFO L109 eAbstractionObserver]: Analyzing ICFG mannadiv.c [2020-07-10 15:30:04,150 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:04,158 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:04,172 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:04,204 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:04,205 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:04,205 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:04,205 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:04,206 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:04,206 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:04,206 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:04,206 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-10 15:30:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:30:04,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:04,242 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:04,243 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash -849943384, now seen corresponding path program 1 times [2020-07-10 15:30:04,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:04,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400318589] [2020-07-10 15:30:04,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 15:30:04,409 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {31#true} {31#true} #55#return; {31#true} is VALID [2020-07-10 15:30:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-10 15:30:04,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-10 15:30:04,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-10 15:30:04,421 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#false} {31#true} #59#return; {32#false} is VALID [2020-07-10 15:30:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:04,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-10 15:30:04,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-10 15:30:04,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-10 15:30:04,440 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#false} {32#false} #61#return; {32#false} is VALID [2020-07-10 15:30:04,441 INFO L263 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2020-07-10 15:30:04,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2020-07-10 15:30:04,441 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #55#return; {31#true} is VALID [2020-07-10 15:30:04,442 INFO L263 TraceCheckUtils]: 3: Hoare triple {31#true} call #t~ret2 := main(); {31#true} is VALID [2020-07-10 15:30:04,442 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2020-07-10 15:30:04,442 INFO L263 TraceCheckUtils]: 5: Hoare triple {31#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {31#true} is VALID [2020-07-10 15:30:04,443 INFO L280 TraceCheckUtils]: 6: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-10 15:30:04,444 INFO L280 TraceCheckUtils]: 7: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-10 15:30:04,444 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-10 15:30:04,445 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {32#false} {31#true} #59#return; {32#false} is VALID [2020-07-10 15:30:04,445 INFO L263 TraceCheckUtils]: 10: Hoare triple {32#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {31#true} is VALID [2020-07-10 15:30:04,445 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#true} ~cond := #in~cond; {31#true} is VALID [2020-07-10 15:30:04,449 INFO L280 TraceCheckUtils]: 12: Hoare triple {31#true} assume 0 == ~cond;assume false; {32#false} is VALID [2020-07-10 15:30:04,449 INFO L280 TraceCheckUtils]: 13: Hoare triple {32#false} assume true; {32#false} is VALID [2020-07-10 15:30:04,450 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {32#false} {32#false} #61#return; {32#false} is VALID [2020-07-10 15:30:04,450 INFO L280 TraceCheckUtils]: 15: Hoare triple {32#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {32#false} is VALID [2020-07-10 15:30:04,451 INFO L280 TraceCheckUtils]: 16: Hoare triple {32#false} assume !true; {32#false} is VALID [2020-07-10 15:30:04,451 INFO L263 TraceCheckUtils]: 17: Hoare triple {32#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {32#false} is VALID [2020-07-10 15:30:04,451 INFO L280 TraceCheckUtils]: 18: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2020-07-10 15:30:04,452 INFO L280 TraceCheckUtils]: 19: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2020-07-10 15:30:04,452 INFO L280 TraceCheckUtils]: 20: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-10 15:30:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:30:04,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400318589] [2020-07-10 15:30:04,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:04,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:30:04,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940716707] [2020-07-10 15:30:04,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-10 15:30:04,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:04,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:30:04,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:04,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:30:04,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:04,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:30:04,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:04,539 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-10 15:30:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:04,657 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2020-07-10 15:30:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:30:04,657 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-07-10 15:30:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-10 15:30:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2020-07-10 15:30:04,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2020-07-10 15:30:04,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:04,826 INFO L225 Difference]: With dead ends: 50 [2020-07-10 15:30:04,826 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 15:30:04,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 15:30:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-10 15:30:04,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:04,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:04,915 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:04,915 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:04,923 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 15:30:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:30:04,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:04,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:04,927 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:04,928 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 15:30:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:04,937 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 15:30:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:30:04,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:04,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:04,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:04,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 15:30:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2020-07-10 15:30:04,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2020-07-10 15:30:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:04,952 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2020-07-10 15:30:04,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:30:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 15:30:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:30:04,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:04,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:04,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:30:04,958 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:04,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1193991140, now seen corresponding path program 1 times [2020-07-10 15:30:04,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:04,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382565935] [2020-07-10 15:30:04,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:04,996 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:04,997 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35177421] [2020-07-10 15:30:04,997 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:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,039 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:30:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:05,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2020-07-10 15:30:05,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2020-07-10 15:30:05,235 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #55#return; {192#true} is VALID [2020-07-10 15:30:05,235 INFO L263 TraceCheckUtils]: 3: Hoare triple {192#true} call #t~ret2 := main(); {192#true} is VALID [2020-07-10 15:30:05,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {192#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {192#true} is VALID [2020-07-10 15:30:05,236 INFO L263 TraceCheckUtils]: 5: Hoare triple {192#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {192#true} is VALID [2020-07-10 15:30:05,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {192#true} ~cond := #in~cond; {192#true} is VALID [2020-07-10 15:30:05,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#true} assume !(0 == ~cond); {192#true} is VALID [2020-07-10 15:30:05,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#true} assume true; {192#true} is VALID [2020-07-10 15:30:05,237 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {192#true} {192#true} #59#return; {192#true} is VALID [2020-07-10 15:30:05,237 INFO L263 TraceCheckUtils]: 10: Hoare triple {192#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {192#true} is VALID [2020-07-10 15:30:05,239 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#true} ~cond := #in~cond; {230#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2020-07-10 15:30:05,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {230#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {234#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-10 15:30:05,241 INFO L280 TraceCheckUtils]: 13: Hoare triple {234#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {234#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID [2020-07-10 15:30:05,242 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {234#(not (= 0 |assume_abort_if_not_#in~cond|))} {192#true} #61#return; {241#(not (= 0 main_~x2~0))} is VALID [2020-07-10 15:30:05,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {241#(not (= 0 main_~x2~0))} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:05,244 INFO L280 TraceCheckUtils]: 16: Hoare triple {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} assume !false; {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:05,245 INFO L263 TraceCheckUtils]: 17: Hoare triple {245#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (not (= 0 main_~x2~0)) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {252#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:05,246 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {256#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:05,247 INFO L280 TraceCheckUtils]: 19: Hoare triple {256#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {193#false} is VALID [2020-07-10 15:30:05,247 INFO L280 TraceCheckUtils]: 20: Hoare triple {193#false} assume !false; {193#false} is VALID [2020-07-10 15:30:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:30:05,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382565935] [2020-07-10 15:30:05,252 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:05,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35177421] [2020-07-10 15:30:05,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:05,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:30:05,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398621975] [2020-07-10 15:30:05,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-10 15:30:05,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:05,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:30:05,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:05,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:30:05,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:30:05,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:05,297 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2020-07-10 15:30:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,615 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-10 15:30:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:30:05,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-07-10 15:30:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-10 15:30:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2020-07-10 15:30:05,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2020-07-10 15:30:05,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:05,688 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:30:05,688 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:30:05,690 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:30:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:30:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2020-07-10 15:30:05,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:05,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 29 states. [2020-07-10 15:30:05,717 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 29 states. [2020-07-10 15:30:05,717 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 29 states. [2020-07-10 15:30:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,722 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-10 15:30:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-10 15:30:05,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,725 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 32 states. [2020-07-10 15:30:05,725 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 32 states. [2020-07-10 15:30:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,730 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-07-10 15:30:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-07-10 15:30:05,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:05,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:30:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-10 15:30:05,743 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2020-07-10 15:30:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:05,744 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-10 15:30:05,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:30:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-10 15:30:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:30:05,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:05,746 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:05,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:30:05,962 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:05,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1415100442, now seen corresponding path program 1 times [2020-07-10 15:30:05,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:05,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340970333] [2020-07-10 15:30:05,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:05,977 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:05,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185494183] [2020-07-10 15:30:05,977 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:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,014 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 15:30:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:06,149 INFO L263 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2020-07-10 15:30:06,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 15:30:06,150 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {422#true} {422#true} #55#return; {422#true} is VALID [2020-07-10 15:30:06,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {422#true} call #t~ret2 := main(); {422#true} is VALID [2020-07-10 15:30:06,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {422#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {422#true} is VALID [2020-07-10 15:30:06,151 INFO L263 TraceCheckUtils]: 5: Hoare triple {422#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {422#true} is VALID [2020-07-10 15:30:06,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-10 15:30:06,151 INFO L280 TraceCheckUtils]: 7: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-10 15:30:06,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 15:30:06,152 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {422#true} {422#true} #59#return; {422#true} is VALID [2020-07-10 15:30:06,152 INFO L263 TraceCheckUtils]: 10: Hoare triple {422#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {422#true} is VALID [2020-07-10 15:30:06,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2020-07-10 15:30:06,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2020-07-10 15:30:06,153 INFO L280 TraceCheckUtils]: 13: Hoare triple {422#true} assume true; {422#true} is VALID [2020-07-10 15:30:06,153 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {422#true} {422#true} #61#return; {422#true} is VALID [2020-07-10 15:30:06,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {422#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {422#true} is VALID [2020-07-10 15:30:06,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {422#true} assume !false; {422#true} is VALID [2020-07-10 15:30:06,154 INFO L263 TraceCheckUtils]: 17: Hoare triple {422#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {422#true} is VALID [2020-07-10 15:30:06,156 INFO L280 TraceCheckUtils]: 18: Hoare triple {422#true} ~cond := #in~cond; {481#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:06,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {481#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:06,157 INFO L280 TraceCheckUtils]: 20: Hoare triple {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:06,159 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {485#(not (= 0 |__VERIFIER_assert_#in~cond|))} {422#true} #63#return; {492#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-10 15:30:06,160 INFO L280 TraceCheckUtils]: 22: Hoare triple {492#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} assume !(0 != ~y3~0); {496#(= (+ main_~y2~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-10 15:30:06,161 INFO L263 TraceCheckUtils]: 23: Hoare triple {496#(= (+ main_~y2~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {500#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:06,162 INFO L280 TraceCheckUtils]: 24: Hoare triple {500#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {504#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:06,163 INFO L280 TraceCheckUtils]: 25: Hoare triple {504#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {423#false} is VALID [2020-07-10 15:30:06,163 INFO L280 TraceCheckUtils]: 26: Hoare triple {423#false} assume !false; {423#false} is VALID [2020-07-10 15:30:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:30:06,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340970333] [2020-07-10 15:30:06,166 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:06,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185494183] [2020-07-10 15:30:06,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:06,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:30:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562048044] [2020-07-10 15:30:06,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:30:06,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:06,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:30:06,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:06,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:30:06,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:30:06,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:06,201 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2020-07-10 15:30:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,652 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-10 15:30:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:30:10,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:30:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-07-10 15:30:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2020-07-10 15:30:10,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2020-07-10 15:30:10,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:10,699 INFO L225 Difference]: With dead ends: 37 [2020-07-10 15:30:10,700 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 15:30:10,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:30:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 15:30:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2020-07-10 15:30:10,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:10,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2020-07-10 15:30:10,717 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2020-07-10 15:30:10,717 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2020-07-10 15:30:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,721 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 15:30:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-10 15:30:10,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:10,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:10,722 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2020-07-10 15:30:10,722 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2020-07-10 15:30:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,725 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-10 15:30:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-10 15:30:10,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:10,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:10,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:10,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:30:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-10 15:30:10,728 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 27 [2020-07-10 15:30:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:10,729 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-10 15:30:10,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:30:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-10 15:30:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:30:10,730 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:10,730 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:10,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:10,945 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:10,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1831429119, now seen corresponding path program 1 times [2020-07-10 15:30:10,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:10,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105353638] [2020-07-10 15:30:10,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:10,961 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:10,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968676792] [2020-07-10 15:30:10,962 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:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-10 15:30:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,999 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:11,125 INFO L263 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2020-07-10 15:30:11,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-10 15:30:11,126 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #55#return; {679#true} is VALID [2020-07-10 15:30:11,126 INFO L263 TraceCheckUtils]: 3: Hoare triple {679#true} call #t~ret2 := main(); {679#true} is VALID [2020-07-10 15:30:11,126 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {679#true} is VALID [2020-07-10 15:30:11,127 INFO L263 TraceCheckUtils]: 5: Hoare triple {679#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {679#true} is VALID [2020-07-10 15:30:11,127 INFO L280 TraceCheckUtils]: 6: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2020-07-10 15:30:11,127 INFO L280 TraceCheckUtils]: 7: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2020-07-10 15:30:11,127 INFO L280 TraceCheckUtils]: 8: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-10 15:30:11,127 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {679#true} {679#true} #59#return; {679#true} is VALID [2020-07-10 15:30:11,128 INFO L263 TraceCheckUtils]: 10: Hoare triple {679#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {679#true} is VALID [2020-07-10 15:30:11,128 INFO L280 TraceCheckUtils]: 11: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2020-07-10 15:30:11,128 INFO L280 TraceCheckUtils]: 12: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2020-07-10 15:30:11,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-10 15:30:11,129 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {679#true} {679#true} #61#return; {679#true} is VALID [2020-07-10 15:30:11,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {679#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:11,130 INFO L280 TraceCheckUtils]: 16: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !false; {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:11,130 INFO L263 TraceCheckUtils]: 17: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {679#true} is VALID [2020-07-10 15:30:11,130 INFO L280 TraceCheckUtils]: 18: Hoare triple {679#true} ~cond := #in~cond; {679#true} is VALID [2020-07-10 15:30:11,131 INFO L280 TraceCheckUtils]: 19: Hoare triple {679#true} assume !(0 == ~cond); {679#true} is VALID [2020-07-10 15:30:11,131 INFO L280 TraceCheckUtils]: 20: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-10 15:30:11,132 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {679#true} {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} #63#return; {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:11,132 INFO L280 TraceCheckUtils]: 22: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !!(0 != ~y3~0); {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:11,133 INFO L280 TraceCheckUtils]: 23: Hoare triple {729#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:11,135 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !false; {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:11,139 INFO L263 TraceCheckUtils]: 25: Hoare triple {754#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 1) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:11,142 INFO L280 TraceCheckUtils]: 26: Hoare triple {761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:11,143 INFO L280 TraceCheckUtils]: 27: Hoare triple {765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {680#false} is VALID [2020-07-10 15:30:11,143 INFO L280 TraceCheckUtils]: 28: Hoare triple {680#false} assume !false; {680#false} is VALID [2020-07-10 15:30:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:30:11,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105353638] [2020-07-10 15:30:11,145 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:11,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968676792] [2020-07-10 15:30:11,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:11,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:30:11,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488804980] [2020-07-10 15:30:11,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 15:30:11,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:11,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:30:11,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:11,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:30:11,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:30:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:11,182 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2020-07-10 15:30:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:11,507 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-10 15:30:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:30:11,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-07-10 15:30:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-10 15:30:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2020-07-10 15:30:11,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2020-07-10 15:30:11,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:11,597 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:30:11,597 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 15:30:11,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 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:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 15:30:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-10 15:30:11,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:11,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-10 15:30:11,649 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 15:30:11,650 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 15:30:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:11,656 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-10 15:30:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 15:30:11,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:11,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:11,657 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-10 15:30:11,657 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-10 15:30:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:11,665 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-10 15:30:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 15:30:11,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:11,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:11,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:11,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 15:30:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-07-10 15:30:11,673 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 29 [2020-07-10 15:30:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:11,674 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-07-10 15:30:11,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:30:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-10 15:30:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:30:11,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:11,678 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:11,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:11,884 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1286102758, now seen corresponding path program 2 times [2020-07-10 15:30:11,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:11,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975224692] [2020-07-10 15:30:11,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:11,902 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:11,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674101381] [2020-07-10 15:30:11,903 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:11,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:30:11,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:30:11,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-10 15:30:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:11,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:12,173 INFO L263 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2020-07-10 15:30:12,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 15:30:12,174 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1009#true} {1009#true} #55#return; {1009#true} is VALID [2020-07-10 15:30:12,174 INFO L263 TraceCheckUtils]: 3: Hoare triple {1009#true} call #t~ret2 := main(); {1009#true} is VALID [2020-07-10 15:30:12,174 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {1009#true} is VALID [2020-07-10 15:30:12,174 INFO L263 TraceCheckUtils]: 5: Hoare triple {1009#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1009#true} is VALID [2020-07-10 15:30:12,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-10 15:30:12,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-10 15:30:12,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 15:30:12,175 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1009#true} {1009#true} #59#return; {1009#true} is VALID [2020-07-10 15:30:12,176 INFO L263 TraceCheckUtils]: 10: Hoare triple {1009#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1009#true} is VALID [2020-07-10 15:30:12,176 INFO L280 TraceCheckUtils]: 11: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-10 15:30:12,181 INFO L280 TraceCheckUtils]: 12: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-10 15:30:12,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 15:30:12,182 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1009#true} {1009#true} #61#return; {1009#true} is VALID [2020-07-10 15:30:12,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {1009#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:12,196 INFO L280 TraceCheckUtils]: 16: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !false; {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:12,196 INFO L263 TraceCheckUtils]: 17: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1009#true} is VALID [2020-07-10 15:30:12,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-10 15:30:12,197 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-10 15:30:12,197 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 15:30:12,199 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1009#true} {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} #63#return; {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:12,200 INFO L280 TraceCheckUtils]: 22: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !!(0 != ~y3~0); {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:12,201 INFO L280 TraceCheckUtils]: 23: Hoare triple {1059#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:12,201 INFO L280 TraceCheckUtils]: 24: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !false; {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:12,202 INFO L263 TraceCheckUtils]: 25: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1009#true} is VALID [2020-07-10 15:30:12,202 INFO L280 TraceCheckUtils]: 26: Hoare triple {1009#true} ~cond := #in~cond; {1009#true} is VALID [2020-07-10 15:30:12,202 INFO L280 TraceCheckUtils]: 27: Hoare triple {1009#true} assume !(0 == ~cond); {1009#true} is VALID [2020-07-10 15:30:12,202 INFO L280 TraceCheckUtils]: 28: Hoare triple {1009#true} assume true; {1009#true} is VALID [2020-07-10 15:30:12,203 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1009#true} {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} #63#return; {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:12,204 INFO L280 TraceCheckUtils]: 30: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !!(0 != ~y3~0); {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:12,206 INFO L280 TraceCheckUtils]: 31: Hoare triple {1084#(and (= 1 main_~x2~0) (= 1 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-10 15:30:12,207 INFO L280 TraceCheckUtils]: 32: Hoare triple {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} assume !false; {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-10 15:30:12,208 INFO L263 TraceCheckUtils]: 33: Hoare triple {1109#(and (= 1 main_~x2~0) (= 2 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:12,209 INFO L280 TraceCheckUtils]: 34: Hoare triple {1116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:12,210 INFO L280 TraceCheckUtils]: 35: Hoare triple {1120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1010#false} is VALID [2020-07-10 15:30:12,210 INFO L280 TraceCheckUtils]: 36: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2020-07-10 15:30:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-10 15:30:12,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975224692] [2020-07-10 15:30:12,215 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:12,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674101381] [2020-07-10 15:30:12,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:12,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:30:12,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134720333] [2020-07-10 15:30:12,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-10 15:30:12,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:12,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:30:12,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:12,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:30:12,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:30:12,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:12,258 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 7 states. [2020-07-10 15:30:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:12,704 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2020-07-10 15:30:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:30:12,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-10 15:30:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:12,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2020-07-10 15:30:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2020-07-10 15:30:12,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2020-07-10 15:30:12,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:12,800 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:30:12,800 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:30:12,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:30:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-10 15:30:12,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:12,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-10 15:30:12,836 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 15:30:12,836 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 15:30:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:12,839 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-10 15:30:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 15:30:12,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:12,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:12,840 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-10 15:30:12,841 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-10 15:30:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:12,843 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-10 15:30:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 15:30:12,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:12,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:12,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:12,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 15:30:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-07-10 15:30:12,849 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 37 [2020-07-10 15:30:12,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:12,849 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-07-10 15:30:12,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:30:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-07-10 15:30:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:30:12,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:12,851 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:13,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:13,052 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash 274985508, now seen corresponding path program 1 times [2020-07-10 15:30:13,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:13,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527118751] [2020-07-10 15:30:13,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:13,064 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:13,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159880183] [2020-07-10 15:30:13,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:30:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:13,104 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-10 15:30:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:13,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:13,290 INFO L263 TraceCheckUtils]: 0: Hoare triple {1402#true} call ULTIMATE.init(); {1402#true} is VALID [2020-07-10 15:30:13,291 INFO L280 TraceCheckUtils]: 1: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-10 15:30:13,291 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1402#true} {1402#true} #55#return; {1402#true} is VALID [2020-07-10 15:30:13,291 INFO L263 TraceCheckUtils]: 3: Hoare triple {1402#true} call #t~ret2 := main(); {1402#true} is VALID [2020-07-10 15:30:13,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {1402#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {1402#true} is VALID [2020-07-10 15:30:13,292 INFO L263 TraceCheckUtils]: 5: Hoare triple {1402#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1402#true} is VALID [2020-07-10 15:30:13,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-10 15:30:13,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-10 15:30:13,292 INFO L280 TraceCheckUtils]: 8: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-10 15:30:13,293 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1402#true} {1402#true} #59#return; {1402#true} is VALID [2020-07-10 15:30:13,293 INFO L263 TraceCheckUtils]: 10: Hoare triple {1402#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1402#true} is VALID [2020-07-10 15:30:13,293 INFO L280 TraceCheckUtils]: 11: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-10 15:30:13,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-10 15:30:13,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-10 15:30:13,294 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1402#true} {1402#true} #61#return; {1402#true} is VALID [2020-07-10 15:30:13,295 INFO L280 TraceCheckUtils]: 15: Hoare triple {1402#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:13,295 INFO L280 TraceCheckUtils]: 16: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !false; {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:13,295 INFO L263 TraceCheckUtils]: 17: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1402#true} is VALID [2020-07-10 15:30:13,296 INFO L280 TraceCheckUtils]: 18: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-10 15:30:13,296 INFO L280 TraceCheckUtils]: 19: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-10 15:30:13,296 INFO L280 TraceCheckUtils]: 20: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-10 15:30:13,297 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1402#true} {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} #63#return; {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:13,297 INFO L280 TraceCheckUtils]: 22: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !!(0 != ~y3~0); {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} is VALID [2020-07-10 15:30:13,298 INFO L280 TraceCheckUtils]: 23: Hoare triple {1452#(and (= 0 main_~y1~0) (= 0 main_~y2~0) (= main_~x1~0 main_~y3~0))} assume !(1 + ~y2~0 == ~x2~0);~y2~0 := 1 + ~y2~0;~y3~0 := ~y3~0 - 1; {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:13,298 INFO L280 TraceCheckUtils]: 24: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !false; {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:13,299 INFO L263 TraceCheckUtils]: 25: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1402#true} is VALID [2020-07-10 15:30:13,299 INFO L280 TraceCheckUtils]: 26: Hoare triple {1402#true} ~cond := #in~cond; {1402#true} is VALID [2020-07-10 15:30:13,299 INFO L280 TraceCheckUtils]: 27: Hoare triple {1402#true} assume !(0 == ~cond); {1402#true} is VALID [2020-07-10 15:30:13,299 INFO L280 TraceCheckUtils]: 28: Hoare triple {1402#true} assume true; {1402#true} is VALID [2020-07-10 15:30:13,300 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1402#true} {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} #63#return; {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:13,301 INFO L280 TraceCheckUtils]: 30: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume !!(0 != ~y3~0); {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} is VALID [2020-07-10 15:30:13,303 INFO L280 TraceCheckUtils]: 31: Hoare triple {1477#(and (= 1 main_~y2~0) (= 0 main_~y1~0) (= (+ main_~y3~0 1) main_~x1~0))} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-10 15:30:13,304 INFO L280 TraceCheckUtils]: 32: Hoare triple {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} assume !false; {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} is VALID [2020-07-10 15:30:13,305 INFO L263 TraceCheckUtils]: 33: Hoare triple {1502#(and (= 2 main_~x2~0) (= 1 main_~y1~0) (= 0 main_~y2~0) (= (+ main_~y3~0 2) main_~x1~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:13,305 INFO L280 TraceCheckUtils]: 34: Hoare triple {1509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:13,306 INFO L280 TraceCheckUtils]: 35: Hoare triple {1513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1403#false} is VALID [2020-07-10 15:30:13,306 INFO L280 TraceCheckUtils]: 36: Hoare triple {1403#false} assume !false; {1403#false} is VALID [2020-07-10 15:30:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-10 15:30:13,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527118751] [2020-07-10 15:30:13,309 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:13,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159880183] [2020-07-10 15:30:13,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:13,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:30:13,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655233243] [2020-07-10 15:30:13,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-10 15:30:13,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:13,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:30:13,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:13,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:30:13,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:13,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:30:13,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:13,359 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 7 states. [2020-07-10 15:30:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:13,819 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2020-07-10 15:30:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:30:13,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2020-07-10 15:30:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-10 15:30:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:30:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-10 15:30:13,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-10 15:30:13,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:13,941 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:30:13,941 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:30:13,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:13,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:30:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-10 15:30:14,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:14,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-10 15:30:14,000 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-10 15:30:14,000 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-10 15:30:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:14,004 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 15:30:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 15:30:14,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:14,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:14,005 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-10 15:30:14,005 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-10 15:30:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:14,009 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-10 15:30:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 15:30:14,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:14,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:14,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:14,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-10 15:30:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-07-10 15:30:14,013 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 37 [2020-07-10 15:30:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:14,014 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-07-10 15:30:14,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:30:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-10 15:30:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-10 15:30:14,015 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:14,015 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:14,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 15:30:14,227 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash 584019147, now seen corresponding path program 3 times [2020-07-10 15:30:14,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:14,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864798271] [2020-07-10 15:30:14,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:14,239 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:14,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861946064] [2020-07-10 15:30:14,240 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:14,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:30:14,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:30:14,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-10 15:30:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-10 15:30:16,302 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:16,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID [2020-07-10 15:30:16,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-10 15:30:16,474 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #55#return; {1871#true} is VALID [2020-07-10 15:30:16,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {1871#true} call #t~ret2 := main(); {1871#true} is VALID [2020-07-10 15:30:16,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x1~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x2~0 := #t~nondet1;havoc #t~nondet1; {1871#true} is VALID [2020-07-10 15:30:16,474 INFO L263 TraceCheckUtils]: 5: Hoare triple {1871#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1871#true} is VALID [2020-07-10 15:30:16,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-10 15:30:16,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-10 15:30:16,475 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-10 15:30:16,475 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1871#true} {1871#true} #59#return; {1871#true} is VALID [2020-07-10 15:30:16,476 INFO L263 TraceCheckUtils]: 10: Hoare triple {1871#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1871#true} is VALID [2020-07-10 15:30:16,476 INFO L280 TraceCheckUtils]: 11: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-10 15:30:16,476 INFO L280 TraceCheckUtils]: 12: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-10 15:30:16,476 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-10 15:30:16,476 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1871#true} {1871#true} #61#return; {1871#true} is VALID [2020-07-10 15:30:16,477 INFO L280 TraceCheckUtils]: 15: Hoare triple {1871#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1871#true} is VALID [2020-07-10 15:30:16,477 INFO L280 TraceCheckUtils]: 16: Hoare triple {1871#true} assume !false; {1871#true} is VALID [2020-07-10 15:30:16,477 INFO L263 TraceCheckUtils]: 17: Hoare triple {1871#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1871#true} is VALID [2020-07-10 15:30:16,477 INFO L280 TraceCheckUtils]: 18: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-10 15:30:16,478 INFO L280 TraceCheckUtils]: 19: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-10 15:30:16,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-10 15:30:16,478 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1871#true} {1871#true} #63#return; {1871#true} is VALID [2020-07-10 15:30:16,478 INFO L280 TraceCheckUtils]: 22: Hoare triple {1871#true} assume !!(0 != ~y3~0); {1871#true} is VALID [2020-07-10 15:30:16,479 INFO L280 TraceCheckUtils]: 23: Hoare triple {1871#true} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1871#true} is VALID [2020-07-10 15:30:16,479 INFO L280 TraceCheckUtils]: 24: Hoare triple {1871#true} assume !false; {1871#true} is VALID [2020-07-10 15:30:16,479 INFO L263 TraceCheckUtils]: 25: Hoare triple {1871#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1871#true} is VALID [2020-07-10 15:30:16,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {1871#true} ~cond := #in~cond; {1871#true} is VALID [2020-07-10 15:30:16,479 INFO L280 TraceCheckUtils]: 27: Hoare triple {1871#true} assume !(0 == ~cond); {1871#true} is VALID [2020-07-10 15:30:16,480 INFO L280 TraceCheckUtils]: 28: Hoare triple {1871#true} assume true; {1871#true} is VALID [2020-07-10 15:30:16,480 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1871#true} {1871#true} #63#return; {1871#true} is VALID [2020-07-10 15:30:16,480 INFO L280 TraceCheckUtils]: 30: Hoare triple {1871#true} assume !!(0 != ~y3~0); {1871#true} is VALID [2020-07-10 15:30:16,480 INFO L280 TraceCheckUtils]: 31: Hoare triple {1871#true} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1871#true} is VALID [2020-07-10 15:30:16,481 INFO L280 TraceCheckUtils]: 32: Hoare triple {1871#true} assume !false; {1871#true} is VALID [2020-07-10 15:30:16,481 INFO L263 TraceCheckUtils]: 33: Hoare triple {1871#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1871#true} is VALID [2020-07-10 15:30:16,484 INFO L280 TraceCheckUtils]: 34: Hoare triple {1871#true} ~cond := #in~cond; {1978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:16,484 INFO L280 TraceCheckUtils]: 35: Hoare triple {1978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:16,485 INFO L280 TraceCheckUtils]: 36: Hoare triple {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:16,486 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1982#(not (= 0 |__VERIFIER_assert_#in~cond|))} {1871#true} #63#return; {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-10 15:30:16,486 INFO L280 TraceCheckUtils]: 38: Hoare triple {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} assume !!(0 != ~y3~0); {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} is VALID [2020-07-10 15:30:18,515 INFO L280 TraceCheckUtils]: 39: Hoare triple {1989#(= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} is UNKNOWN [2020-07-10 15:30:18,516 INFO L280 TraceCheckUtils]: 40: Hoare triple {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} assume !false; {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} is VALID [2020-07-10 15:30:18,517 INFO L263 TraceCheckUtils]: 41: Hoare triple {1996#(and (= main_~x1~0 (+ main_~y3~0 (* main_~y1~0 main_~x2~0))) (= 0 main_~y2~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:18,517 INFO L280 TraceCheckUtils]: 42: Hoare triple {2003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:18,518 INFO L280 TraceCheckUtils]: 43: Hoare triple {2007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1872#false} is VALID [2020-07-10 15:30:18,518 INFO L280 TraceCheckUtils]: 44: Hoare triple {1872#false} assume !false; {1872#false} is VALID [2020-07-10 15:30:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-10 15:30:18,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864798271] [2020-07-10 15:30:18,522 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:18,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861946064] [2020-07-10 15:30:18,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:18,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 15:30:18,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905196927] [2020-07-10 15:30:18,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 15:30:18,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:18,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:30:20,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:20,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:30:20,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:20,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:30:20,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:30:20,632 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2020-07-10 15:30:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:25,007 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-07-10 15:30:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:30:25,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-07-10 15:30:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-10 15:30:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:30:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-10 15:30:25,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2020-07-10 15:30:27,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:27,134 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:30:27,134 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:30:27,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:30:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:30:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:30:27,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:27,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:27,136 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:27,137 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:27,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:30:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:30:27,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:27,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:27,137 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:27,137 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:30:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:27,138 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:30:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:30:27,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:27,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:27,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:27,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:30:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:30:27,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-07-10 15:30:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:27,139 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:30:27,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:30:27,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:30:27,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:27,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:27,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:30:27,503 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:30:27,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:30:27,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:30:27,504 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:30:27,504 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:30:27,504 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:30:27,504 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2020-07-10 15:30:27,504 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-10 15:30:27,504 INFO L268 CegarLoopResult]: For program point L11-2(lines 10 12) no Hoare annotation was computed. [2020-07-10 15:30:27,504 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 10 12) no Hoare annotation was computed. [2020-07-10 15:30:27,504 INFO L264 CegarLoopResult]: At program point L33-2(lines 33 46) the Hoare annotation is: (let ((.cse0 (* main_~y1~0 main_~x2~0))) (and (= (+ main_~y2~0 .cse0) main_~x1~0) (not (= 0 main_~x2~0)) (= (+ main_~y2~0 main_~y3~0 .cse0) main_~x1~0))) [2020-07-10 15:30:27,505 INFO L268 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-07-10 15:30:27,505 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 20 49) no Hoare annotation was computed. [2020-07-10 15:30:27,505 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 20 49) no Hoare annotation was computed. [2020-07-10 15:30:27,505 INFO L268 CegarLoopResult]: For program point L38(lines 38 45) no Hoare annotation was computed. [2020-07-10 15:30:27,505 INFO L264 CegarLoopResult]: At program point L38-2(lines 33 46) the Hoare annotation is: (and (not (= 0 main_~x2~0)) (= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)) [2020-07-10 15:30:27,505 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (not (= 0 main_~x2~0)) (= (+ main_~y2~0 main_~y3~0 (* main_~y1~0 main_~x2~0)) main_~x1~0)) [2020-07-10 15:30:27,505 INFO L268 CegarLoopResult]: For program point L34-1(lines 33 46) no Hoare annotation was computed. [2020-07-10 15:30:27,505 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2020-07-10 15:30:27,505 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-07-10 15:30:27,505 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-07-10 15:30:27,505 INFO L268 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-07-10 15:30:27,506 INFO L268 CegarLoopResult]: For program point L15(lines 15 16) no Hoare annotation was computed. [2020-07-10 15:30:27,506 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2020-07-10 15:30:27,506 INFO L268 CegarLoopResult]: For program point L14(lines 14 17) no Hoare annotation was computed. [2020-07-10 15:30:27,506 INFO L268 CegarLoopResult]: For program point L14-2(lines 13 19) no Hoare annotation was computed. [2020-07-10 15:30:27,506 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 13 19) no Hoare annotation was computed. [2020-07-10 15:30:27,506 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2020-07-10 15:30:27,510 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:30:27,510 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:30:27,510 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:30:27,510 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:30:27,510 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:30:27,510 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 15:30:27,511 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:30:27,512 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:30:27,512 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:30:27,512 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:27,512 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:27,513 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:30:27,513 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:30:27,513 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 15:30:27,513 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-10 15:30:27,514 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:30:27,514 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:30:27,514 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-10 15:30:27,514 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:30:27,514 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:30:27,514 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:30:27,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:30:27 BoogieIcfgContainer [2020-07-10 15:30:27,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:30:27,529 INFO L168 Benchmark]: Toolchain (without parser) took 24091.42 ms. Allocated memory was 146.3 MB in the beginning and 272.6 MB in the end (delta: 126.4 MB). Free memory was 104.7 MB in the beginning and 103.9 MB in the end (delta: 784.0 kB). Peak memory consumption was 127.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:27,530 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 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:30:27,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.53 ms. Allocated memory is still 146.3 MB. Free memory was 104.2 MB in the beginning and 94.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:27,531 INFO L168 Benchmark]: Boogie Preprocessor took 33.31 ms. Allocated memory is still 146.3 MB. Free memory was 94.4 MB in the beginning and 92.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:27,532 INFO L168 Benchmark]: RCFGBuilder took 411.21 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 92.8 MB in the beginning and 165.1 MB in the end (delta: -72.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:27,533 INFO L168 Benchmark]: TraceAbstraction took 23392.83 ms. Allocated memory was 203.4 MB in the beginning and 272.6 MB in the end (delta: 69.2 MB). Free memory was 164.4 MB in the beginning and 103.9 MB in the end (delta: 60.5 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:27,536 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.53 ms. Allocated memory is still 146.3 MB. Free memory was 104.2 MB in the beginning and 94.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.31 ms. Allocated memory is still 146.3 MB. Free memory was 94.4 MB in the beginning and 92.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.21 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 92.8 MB in the beginning and 165.1 MB in the end (delta: -72.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23392.83 ms. Allocated memory was 203.4 MB in the beginning and 272.6 MB in the end (delta: 69.2 MB). Free memory was 164.4 MB in the beginning and 103.9 MB in the end (delta: 60.5 MB). Peak memory consumption was 129.8 MB. Max. memory is 7.1 GB. * 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: 33]: Loop Invariant Derived loop invariant: !(0 == x2) && y2 + y3 + y1 * x2 == x1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.1s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 150 SDtfs, 60 SDslu, 523 SDs, 0 SdLazy, 347 SolverSat, 21 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 28 PreInvPairs, 44 NumberOfFragments, 54 HoareAnnotationTreeSize, 28 FomulaSimplifications, 453 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 217 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 20250 SizeOfPredicates, 16 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 82/102 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...