/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/ps3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:30:03,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:30:03,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:30:03,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:30:03,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:30:03,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:30:03,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:30:03,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:30:03,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:30:03,658 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:30:03,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:30:03,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:30:03,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:30:03,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:30:03,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:30:03,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:30:03,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:30:03,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:30:03,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:30:03,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:30:03,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:30:03,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:30:03,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:30:03,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:30:03,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:30:03,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:30:03,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:30:03,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:30:03,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:30:03,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:30:03,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:30:03,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:30:03,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:30:03,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:30:03,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:30:03,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:30:03,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:30:03,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:30:03,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:30:03,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:30:03,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:30:03,724 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:03,763 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:30:03,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:30:03,765 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:30:03,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:30:03,766 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:30:03,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:30:03,767 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:30:03,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:30:03,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:30:03,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:30:03,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:30:03,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:30:03,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:30:03,773 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:30:03,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:30:03,774 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:30:03,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:30:03,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:30:03,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:30:03,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:30:03,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:30:03,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:30:03,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:30:03,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:30:03,775 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:30:03,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:30:03,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:30:03,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:30:03,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:30:03,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:30:04,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:30:04,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:30:04,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:30:04,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:30:04,185 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:30:04,186 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps3.c [2020-07-10 15:30:04,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40cbe766e/ce4427f14f574008aa0d8e2716591d1f/FLAGcabbdba29 [2020-07-10 15:30:04,939 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:30:04,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps3.c [2020-07-10 15:30:04,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40cbe766e/ce4427f14f574008aa0d8e2716591d1f/FLAGcabbdba29 [2020-07-10 15:30:05,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40cbe766e/ce4427f14f574008aa0d8e2716591d1f [2020-07-10 15:30:05,297 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:30:05,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:30:05,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:05,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:30:05,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:30:05,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:05" (1/1) ... [2020-07-10 15:30:05,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705da547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:05, skipping insertion in model container [2020-07-10 15:30:05,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:30:05" (1/1) ... [2020-07-10 15:30:05,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:05,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:05,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:05,701 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:05,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:05,750 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:05,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:05 WrapperNode [2020-07-10 15:30:05,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:05,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:05,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:05,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:05,768 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:05" (1/1) ... [2020-07-10 15:30:05,769 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:05" (1/1) ... [2020-07-10 15:30:05,776 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:05" (1/1) ... [2020-07-10 15:30:05,777 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:05" (1/1) ... [2020-07-10 15:30:05,782 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:05" (1/1) ... [2020-07-10 15:30:05,790 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:05" (1/1) ... [2020-07-10 15:30:05,791 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:05" (1/1) ... [2020-07-10 15:30:05,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:05,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:05,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:05,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:05,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:05" (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:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:05,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:30:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:05,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:30:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:30:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:30:05,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:05,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:06,295 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:06,296 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:30:06,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:06 BoogieIcfgContainer [2020-07-10 15:30:06,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:06,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:06,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:06,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:06,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:30:05" (1/3) ... [2020-07-10 15:30:06,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49414629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:06, skipping insertion in model container [2020-07-10 15:30:06,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:05" (2/3) ... [2020-07-10 15:30:06,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49414629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:06, skipping insertion in model container [2020-07-10 15:30:06,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:06" (3/3) ... [2020-07-10 15:30:06,322 INFO L109 eAbstractionObserver]: Analyzing ICFG ps3.c [2020-07-10 15:30:06,342 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:06,353 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:06,372 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:06,428 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:06,428 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:06,431 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:06,432 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:06,432 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:06,432 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:06,432 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:06,432 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 15:30:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:06,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:06,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:06,469 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-10 15:30:06,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:06,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628678466] [2020-07-10 15:30:06,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:30:06,696 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-10 15:30:06,699 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 15:30:06,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:30:06,700 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-10 15:30:06,700 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret1 := main(); {23#true} is VALID [2020-07-10 15:30:06,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {23#true} is VALID [2020-07-10 15:30:06,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-10 15:30:06,703 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-10 15:30:06,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-10 15:30:06,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-10 15:30:06,704 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 15:30:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:06,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628678466] [2020-07-10 15:30:06,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:06,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:30:06,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382471449] [2020-07-10 15:30:06,718 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:30:06,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:06,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:30:06,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:06,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:30:06,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:30:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:30:06,792 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-10 15:30:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:06,902 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-10 15:30:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:30:06,903 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-10 15:30:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 15:30:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:30:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 15:30:06,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-10 15:30:07,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:07,056 INFO L225 Difference]: With dead ends: 35 [2020-07-10 15:30:07,056 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:30:07,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:30:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:30:07,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:07,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:07,113 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:07,113 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,118 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-10 15:30:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:07,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:07,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:07,120 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:07,120 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:30:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,124 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-10 15:30:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:07,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:07,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:07,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:07,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:30:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-10 15:30:07,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-10 15:30:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:07,133 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-10 15:30:07,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:30:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:30:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-10 15:30:07,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:07,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:07,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:30:07,135 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:07,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:07,136 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-10 15:30:07,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:07,137 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999388493] [2020-07-10 15:30:07,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:07,146 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:07,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1236323865] [2020-07-10 15:30:07,147 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:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:07,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:30:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:07,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:07,328 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-10 15:30:07,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-10 15:30:07,329 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-10 15:30:07,330 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret1 := main(); {129#true} is VALID [2020-07-10 15:30:07,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:07,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !false; {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:07,335 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 0 main_~x~0) (= 0 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:07,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:07,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-10 15:30:07,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-10 15:30:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:07,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999388493] [2020-07-10 15:30:07,341 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:07,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236323865] [2020-07-10 15:30:07,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:30:07,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027820327] [2020-07-10 15:30:07,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:07,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:07,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:30:07,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:07,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:30:07,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:30:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:30:07,367 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-10 15:30:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,653 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:30:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:30:07,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-10 15:30:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-10 15:30:07,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:30:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-10 15:30:07,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-10 15:30:07,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:07,728 INFO L225 Difference]: With dead ends: 25 [2020-07-10 15:30:07,728 INFO L226 Difference]: Without dead ends: 22 [2020-07-10 15:30:07,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-10 15:30:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-10 15:30:07,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:07,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:07,745 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:07,746 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,748 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:30:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:07,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:07,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:07,750 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:07,750 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-10 15:30:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:07,753 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-10 15:30:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:07,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:07,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:07,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:07,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 15:30:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-10 15:30:07,757 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-10 15:30:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:07,758 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-10 15:30:07,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:30:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-10 15:30:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:30:07,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:07,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:07,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:30:07,975 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:07,976 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-10 15:30:07,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:07,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537511641] [2020-07-10 15:30:07,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:07,984 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:07,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699709110] [2020-07-10 15:30:07,985 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:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:08,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 15:30:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:08,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:08,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 15:30:08,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 15:30:08,197 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-10 15:30:08,198 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret1 := main(); {279#true} is VALID [2020-07-10 15:30:08,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:08,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !false; {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:08,209 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-10 15:30:08,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {279#true} is VALID [2020-07-10 15:30:08,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(0 == ~cond); {279#true} is VALID [2020-07-10 15:30:08,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 15:30:08,212 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {279#true} {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} #50#return; {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:08,214 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {318#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:08,216 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} assume !false; {318#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:08,217 INFO L263 TraceCheckUtils]: 13: Hoare triple {318#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:08,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:08,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-10 15:30:08,220 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 15:30:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:30:08,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537511641] [2020-07-10 15:30:08,224 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:08,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699709110] [2020-07-10 15:30:08,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:08,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 15:30:08,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195005090] [2020-07-10 15:30:08,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:08,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:08,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:30:08,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:08,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:30:08,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:08,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:30:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:30:08,259 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2020-07-10 15:30:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:08,601 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-10 15:30:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:30:08,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-10 15:30:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-10 15:30:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:30:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-10 15:30:08,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-10 15:30:08,681 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:08,685 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:30:08,685 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:30:08,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:30:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:30:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:30:08,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:08,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:08,730 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:08,730 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:08,739 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:30:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:30:08,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:08,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:08,743 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:08,744 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:30:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:08,750 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-10 15:30:08,750 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:30:08,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:08,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:08,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:08,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:30:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-07-10 15:30:08,764 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2020-07-10 15:30:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:08,764 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-07-10 15:30:08,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:30:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-10 15:30:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:30:08,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:08,769 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:08,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:08,970 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-10 15:30:08,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:08,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51063105] [2020-07-10 15:30:08,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:08,978 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:08,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195216249] [2020-07-10 15:30:08,979 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 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:09,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:30:09,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:30:09,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-10 15:30:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:09,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:09,307 INFO L263 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2020-07-10 15:30:09,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 15:30:09,308 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #46#return; {485#true} is VALID [2020-07-10 15:30:09,309 INFO L263 TraceCheckUtils]: 3: Hoare triple {485#true} call #t~ret1 := main(); {485#true} is VALID [2020-07-10 15:30:09,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {485#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0;~y~0 := 0;~x~0 := 0;~c~0 := 0; {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:09,312 INFO L280 TraceCheckUtils]: 5: Hoare triple {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !false; {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:09,312 INFO L263 TraceCheckUtils]: 6: Hoare triple {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {485#true} is VALID [2020-07-10 15:30:09,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {485#true} ~cond := #in~cond; {485#true} is VALID [2020-07-10 15:30:09,313 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#true} assume !(0 == ~cond); {485#true} is VALID [2020-07-10 15:30:09,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {485#true} assume true; {485#true} is VALID [2020-07-10 15:30:09,315 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {485#true} {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} #50#return; {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} is VALID [2020-07-10 15:30:09,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#(and (= 0 main_~x~0) (= 0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:09,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} assume !false; {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:09,320 INFO L263 TraceCheckUtils]: 13: Hoare triple {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {485#true} is VALID [2020-07-10 15:30:09,321 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#true} ~cond := #in~cond; {534#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:09,322 INFO L280 TraceCheckUtils]: 15: Hoare triple {534#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {538#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:09,324 INFO L280 TraceCheckUtils]: 16: Hoare triple {538#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {538#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:30:09,325 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {538#(not (= 0 |__VERIFIER_assert_#in~cond|))} {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} #50#return; {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} is VALID [2020-07-10 15:30:09,327 INFO L280 TraceCheckUtils]: 18: Hoare triple {524#(and (= main_~x~0 (* main_~y~0 main_~y~0)) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 + ~x~0; {548#(and (= (+ (* 2 main_~y~0) main_~x~0) (+ (* 2 (* main_~y~0 main_~y~0)) 1)) (= 2 main_~y~0))} is VALID [2020-07-10 15:30:09,329 INFO L280 TraceCheckUtils]: 19: Hoare triple {548#(and (= (+ (* 2 main_~y~0) main_~x~0) (+ (* 2 (* main_~y~0 main_~y~0)) 1)) (= 2 main_~y~0))} assume !false; {548#(and (= (+ (* 2 main_~y~0) main_~x~0) (+ (* 2 (* main_~y~0 main_~y~0)) 1)) (= 2 main_~y~0))} is VALID [2020-07-10 15:30:09,331 INFO L263 TraceCheckUtils]: 20: Hoare triple {548#(and (= (+ (* 2 main_~y~0) main_~x~0) (+ (* 2 (* main_~y~0 main_~y~0)) 1)) (= 2 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~x~0 - 2 * ~y~0 * ~y~0 * ~y~0 - 3 * ~y~0 * ~y~0 - ~y~0 then 1 else 0)); {555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:30:09,333 INFO L280 TraceCheckUtils]: 21: Hoare triple {555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:30:09,334 INFO L280 TraceCheckUtils]: 22: Hoare triple {559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {486#false} is VALID [2020-07-10 15:30:09,335 INFO L280 TraceCheckUtils]: 23: Hoare triple {486#false} assume !false; {486#false} is VALID [2020-07-10 15:30:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:30:09,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51063105] [2020-07-10 15:30:09,338 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:30:09,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195216249] [2020-07-10 15:30:09,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:30:09,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:30:09,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863835742] [2020-07-10 15:30:09,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-10 15:30:09,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:09,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:30:09,387 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:09,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:30:09,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:30:09,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:30:09,389 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2020-07-10 15:30:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,005 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-10 15:30:10,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:30:10,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-10 15:30:10,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:30:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-10 15:30:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:30:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-10 15:30:10,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-10 15:30:10,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:10,083 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:30:10,083 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:30:10,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:30:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:30:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-10 15:30:10,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:10,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:10,108 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:10,108 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,111 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:30:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:30:10,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:10,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:10,113 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:10,113 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-10 15:30:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,116 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-10 15:30:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:30:10,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:10,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:10,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:10,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 15:30:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-10 15:30:10,126 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2020-07-10 15:30:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:10,127 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-10 15:30:10,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:30:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-10 15:30:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:30:10,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:10,132 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:10,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:10,345 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:10,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-10 15:30:10,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:10,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488108134] [2020-07-10 15:30:10,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:10,354 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:30:10,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684565171] [2020-07-10 15:30:10,355 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 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