/usr/bin/java -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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/nla-digbench/ps6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:36:53,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:36:53,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:36:53,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:36:53,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:36:53,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:36:53,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:36:53,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:36:53,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:36:53,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:36:53,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:36:53,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:36:53,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:36:53,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:36:53,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:36:53,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:36:53,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:36:53,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:36:53,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:36:53,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:36:53,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:36:53,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:36:53,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:36:53,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:36:53,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:36:53,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:36:53,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:36:53,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:36:53,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:36:53,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:36:53,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:36:53,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:36:53,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:36:53,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:36:53,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:36:53,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:36:53,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:36:53,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:36:53,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:36:53,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:36:53,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:36:53,634 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 [2019-11-07 00:36:53,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:36:53,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:36:53,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:36:53,671 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:36:53,671 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:36:53,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:36:53,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:36:53,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:36:53,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:36:53,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:36:53,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:36:53,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:36:53,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:36:53,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:36:53,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:36:53,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:36:53,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:36:53,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:36:53,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:36:53,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:36:53,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:36:53,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:36:53,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:36:53,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:36:53,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:36:53,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:36:53,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:36:53,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:36:53,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:36:53,994 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:36:54,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:36:54,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:36:54,015 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:36:54,015 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:36:54,016 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps6.c [2019-11-07 00:36:54,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f359ed969/b9280e1293cc470d888d33a775e01179/FLAG4de876c45 [2019-11-07 00:36:54,542 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:36:54,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps6.c [2019-11-07 00:36:54,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f359ed969/b9280e1293cc470d888d33a775e01179/FLAG4de876c45 [2019-11-07 00:36:54,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f359ed969/b9280e1293cc470d888d33a775e01179 [2019-11-07 00:36:54,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:36:54,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:36:54,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:36:54,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:36:54,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:36:54,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:54" (1/1) ... [2019-11-07 00:36:54,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6116f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:54, skipping insertion in model container [2019-11-07 00:36:54,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:36:54" (1/1) ... [2019-11-07 00:36:54,959 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:36:54,977 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:36:55,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:36:55,153 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:36:55,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:36:55,190 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:36:55,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55 WrapperNode [2019-11-07 00:36:55,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:36:55,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:36:55,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:36:55,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:36:55,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,332 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (1/1) ... [2019-11-07 00:36:55,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:36:55,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:36:55,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:36:55,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:36:55,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (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 [2019-11-07 00:36:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:36:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:36:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:36:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:36:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:36:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:36:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:36:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:36:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:36:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:36:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:36:55,587 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:36:55,588 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 00:36:55,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:55 BoogieIcfgContainer [2019-11-07 00:36:55,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:36:55,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:36:55,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:36:55,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:36:55,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:36:54" (1/3) ... [2019-11-07 00:36:55,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d46c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:55, skipping insertion in model container [2019-11-07 00:36:55,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:36:55" (2/3) ... [2019-11-07 00:36:55,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d46c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:36:55, skipping insertion in model container [2019-11-07 00:36:55,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:36:55" (3/3) ... [2019-11-07 00:36:55,597 INFO L109 eAbstractionObserver]: Analyzing ICFG ps6.c [2019-11-07 00:36:55,606 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:36:55,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:36:55,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:36:55,644 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:36:55,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:36:55,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:36:55,644 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:36:55,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:36:55,645 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:36:55,645 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:36:55,645 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:36:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-11-07 00:36:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:36:55,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:55,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:55,666 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash -148746498, now seen corresponding path program 1 times [2019-11-07 00:36:55,678 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:55,679 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133120625] [2019-11-07 00:36:55,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:55,773 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133120625] [2019-11-07 00:36:55,774 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:55,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:36:55,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467441145] [2019-11-07 00:36:55,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:36:55,781 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:55,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:36:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:36:55,798 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-07 00:36:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:55,821 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-07 00:36:55,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:36:55,822 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-07 00:36:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:55,829 INFO L225 Difference]: With dead ends: 37 [2019-11-07 00:36:55,830 INFO L226 Difference]: Without dead ends: 16 [2019-11-07 00:36:55,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:36:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-07 00:36:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-07 00:36:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-07 00:36:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-11-07 00:36:55,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-11-07 00:36:55,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:55,871 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-11-07 00:36:55,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:36:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-11-07 00:36:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 00:36:55,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:55,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:55,873 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash -156194248, now seen corresponding path program 1 times [2019-11-07 00:36:55,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:55,875 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301644338] [2019-11-07 00:36:55,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:55,882 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:55,882 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415643036] [2019-11-07 00:36:55,883 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 [2019-11-07 00:36:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:55,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-07 00:36:55,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:56,065 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:36:56,133 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301644338] [2019-11-07 00:36:56,134 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:36:56,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415643036] [2019-11-07 00:36:56,134 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:36:56,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-07 00:36:56,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709222098] [2019-11-07 00:36:56,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:36:56,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:36:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:36:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:36:56,139 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-11-07 00:36:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:36:56,480 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2019-11-07 00:36:56,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:36:56,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-07 00:36:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:36:56,482 INFO L225 Difference]: With dead ends: 27 [2019-11-07 00:36:56,482 INFO L226 Difference]: Without dead ends: 21 [2019-11-07 00:36:56,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:36:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-07 00:36:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-07 00:36:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-07 00:36:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-11-07 00:36:56,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2019-11-07 00:36:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:36:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-11-07 00:36:56,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:36:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-11-07 00:36:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:36:56,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:36:56,495 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:36:56,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:36:56,700 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:36:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:36:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1054216485, now seen corresponding path program 1 times [2019-11-07 00:36:56,702 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:36:56,702 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622759244] [2019-11-07 00:36:56,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:36:56,718 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:36:56,719 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797286368] [2019-11-07 00:36:56,719 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 [2019-11-07 00:36:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:36:56,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-07 00:36:56,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:36:56,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:36:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-07 00:36:56,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:36:57,187 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-07 00:36:57,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:36:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:37:00,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~y~0 1))) (let ((.cse4 (* (* (* (* (* (+ (* c_main_~y~0 (- 2)) (- 2)) .cse1) .cse1) .cse1) .cse1) .cse1)) (.cse0 (* .cse1 .cse1)) (.cse2 (* (* (* (+ (* c_main_~y~0 5) 5) .cse1) .cse1) .cse1)) (.cse3 (* (* (* (* (+ (* c_main_~y~0 6) 6) .cse1) .cse1) .cse1) .cse1))) (or (not (= (+ (* (* (* .cse0 .cse1) .cse1) .cse1) c_main_~x~0) (div (+ (* .cse2 (- 1)) (* .cse3 (- 1)) .cse4 .cse0) (- 12)))) (not (= (mod (+ .cse4 .cse0 (* .cse2 11) (* .cse3 11)) (- 12)) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (let ((.cse5 (+ c_main_~y~0 1))) (= (* main_~k~0 .cse5) (* .cse5 .cse5))) (<= main_~k~0 c_main_~c~0)))))) is different from false [2019-11-07 00:37:01,174 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-07 00:37:01,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:37:03,307 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_main_~y~0 6)) (.cse6 (* c_main_~y~0 5)) (.cse7 (* c_main_~y~0 (- 2))) (.cse1 (+ c_main_~y~0 1))) (let ((.cse4 (* (* (* (* (* (+ .cse7 (- 2)) .cse1) .cse1) .cse1) .cse1) .cse1)) (.cse0 (* .cse1 .cse1)) (.cse2 (* (* (* (+ .cse6 5) .cse1) .cse1) .cse1)) (.cse3 (* (* (* (* (+ .cse5 6) .cse1) .cse1) .cse1) .cse1))) (or (not (= (+ (* (* (* .cse0 .cse1) .cse1) .cse1) c_main_~x~0) (div (+ (* .cse2 (- 1)) (* .cse3 (- 1)) .cse4 .cse0) (- 12)))) (not (= (+ (* (* (* (* .cse5 c_main_~y~0) c_main_~y~0) c_main_~y~0) c_main_~y~0) (* (* (* .cse6 c_main_~y~0) c_main_~y~0) c_main_~y~0)) (+ (* 12 c_main_~x~0) (* (* (* (* (* .cse7 c_main_~y~0) c_main_~y~0) c_main_~y~0) c_main_~y~0) c_main_~y~0) (* c_main_~y~0 c_main_~y~0)))) (not (= (mod (+ .cse4 .cse0 (* .cse2 11) (* .cse3 11)) (- 12)) 0)) (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (let ((.cse8 (+ c_main_~y~0 1))) (= (* main_~k~0 .cse8) (* .cse8 .cse8))) (<= main_~k~0 c_main_~c~0)))))) is different from false [2019-11-07 00:37:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:37:05,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:37:14,420 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or (forall ((main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_8 Int)) (let ((.cse6 (* v_main_~y~0_BEFORE_CALL_8 5)) (.cse4 (* v_main_~y~0_BEFORE_CALL_8 (- 2))) (.cse5 (* v_main_~y~0_BEFORE_CALL_8 6)) (.cse7 (+ v_main_~y~0_BEFORE_CALL_8 1))) (let ((.cse0 (* (* (* (* (+ .cse5 6) .cse7) .cse7) .cse7) .cse7)) (.cse2 (* (* (* (* (* (+ .cse4 (- 2)) .cse7) .cse7) .cse7) .cse7) .cse7)) (.cse1 (* (* (* (+ .cse6 5) .cse7) .cse7) .cse7)) (.cse3 (* .cse7 .cse7))) (or (not (= (mod (+ (* .cse0 11) (* .cse1 11) .cse2 .cse3) (- 12)) 0)) (= (+ (* 12 (div (+ (* .cse0 (- 1)) .cse2 .cse3 (* .cse1 (- 1))) (- 12))) (* v_main_~y~0_BEFORE_CALL_8 v_main_~y~0_BEFORE_CALL_8) (* (* (* (* (* .cse4 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8)) (+ (* (* (* (* .cse5 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* (* (* .cse6 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* 12 (* (* (* .cse3 .cse7) .cse7) .cse7)))) (= .cse3 (* main_~k~0 .cse7)))))) .cse8 (not (= |c___VERIFIER_assert_#in~cond| 1))) (or .cse8 (forall ((main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_8 Int)) (let ((.cse18 (* v_main_~y~0_BEFORE_CALL_8 5)) (.cse16 (* v_main_~y~0_BEFORE_CALL_8 (- 2))) (.cse17 (* v_main_~y~0_BEFORE_CALL_8 6)) (.cse15 (+ v_main_~y~0_BEFORE_CALL_8 1))) (let ((.cse9 (* (* (* (* (+ .cse17 6) .cse15) .cse15) .cse15) .cse15)) (.cse11 (* (* (* (* (* (+ .cse16 (- 2)) .cse15) .cse15) .cse15) .cse15) .cse15)) (.cse10 (* (* (* (+ .cse18 5) .cse15) .cse15) .cse15)) (.cse12 (* .cse15 .cse15))) (let ((.cse14 (+ (* (* (* (* .cse17 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* (* (* .cse18 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* 12 (* (* (* .cse12 .cse15) .cse15) .cse15)))) (.cse13 (+ (* 12 (div (+ (* .cse9 (- 1)) .cse11 .cse12 (* .cse10 (- 1))) (- 12))) (* v_main_~y~0_BEFORE_CALL_8 v_main_~y~0_BEFORE_CALL_8) (* (* (* (* (* .cse16 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8)))) (or (not (= (mod (+ (* .cse9 11) (* .cse10 11) .cse11 .cse12) (- 12)) 0)) (= .cse13 .cse14) (= .cse14 .cse13) (= .cse12 (* main_~k~0 .cse15)))))))))) is different from true [2019-11-07 00:37:24,845 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (not (= |c___VERIFIER_assert_#in~cond| 0)))) (and (or (forall ((main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_8 Int)) (let ((.cse6 (* v_main_~y~0_BEFORE_CALL_8 5)) (.cse4 (* v_main_~y~0_BEFORE_CALL_8 (- 2))) (.cse5 (* v_main_~y~0_BEFORE_CALL_8 6)) (.cse7 (+ v_main_~y~0_BEFORE_CALL_8 1))) (let ((.cse0 (* (* (* (* (+ .cse5 6) .cse7) .cse7) .cse7) .cse7)) (.cse2 (* (* (* (* (* (+ .cse4 (- 2)) .cse7) .cse7) .cse7) .cse7) .cse7)) (.cse1 (* (* (* (+ .cse6 5) .cse7) .cse7) .cse7)) (.cse3 (* .cse7 .cse7))) (or (not (= (mod (+ (* .cse0 11) (* .cse1 11) .cse2 .cse3) (- 12)) 0)) (= (+ (* 12 (div (+ (* .cse0 (- 1)) .cse2 .cse3 (* .cse1 (- 1))) (- 12))) (* v_main_~y~0_BEFORE_CALL_8 v_main_~y~0_BEFORE_CALL_8) (* (* (* (* (* .cse4 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8)) (+ (* (* (* (* .cse5 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* (* (* .cse6 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* 12 (* (* (* .cse3 .cse7) .cse7) .cse7)))) (= .cse3 (* main_~k~0 .cse7)))))) .cse8 (not (= |c___VERIFIER_assert_#in~cond| 1))) (or .cse8 (forall ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse16 (* v_prenex_3 5)) (.cse18 (* v_prenex_3 (- 2))) (.cse17 (* v_prenex_3 6)) (.cse12 (+ v_prenex_3 1))) (let ((.cse13 (* (* (* (* (+ .cse17 6) .cse12) .cse12) .cse12) .cse12)) (.cse15 (* (* (* (* (* (+ .cse18 (- 2)) .cse12) .cse12) .cse12) .cse12) .cse12)) (.cse11 (* .cse12 .cse12)) (.cse14 (* (* (* (+ .cse16 5) .cse12) .cse12) .cse12))) (let ((.cse10 (+ (* 12 (div (+ (* .cse13 (- 1)) .cse15 .cse11 (* .cse14 (- 1))) (- 12))) (* v_prenex_3 v_prenex_3) (* (* (* (* (* .cse18 v_prenex_3) v_prenex_3) v_prenex_3) v_prenex_3) v_prenex_3))) (.cse9 (+ (* (* (* .cse16 v_prenex_3) v_prenex_3) v_prenex_3) (* (* (* (* .cse17 v_prenex_3) v_prenex_3) v_prenex_3) v_prenex_3) (* 12 (* (* (* .cse11 .cse12) .cse12) .cse12))))) (or (= .cse9 .cse10) (= .cse10 .cse9) (= .cse11 (* v_prenex_2 .cse12)) (not (= (mod (+ (* .cse13 11) (* .cse14 11) .cse15 .cse11) (- 12)) 0)))))))))) is different from true [2019-11-07 00:37:35,227 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| 0))) (.cse11 (= 0 c___VERIFIER_assert_~cond))) (and (or .cse0 (forall ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse8 (* v_prenex_3 5)) (.cse10 (* v_prenex_3 (- 2))) (.cse9 (* v_prenex_3 6)) (.cse4 (+ v_prenex_3 1))) (let ((.cse5 (* (* (* (* (+ .cse9 6) .cse4) .cse4) .cse4) .cse4)) (.cse7 (* (* (* (* (* (+ .cse10 (- 2)) .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse3 (* .cse4 .cse4)) (.cse6 (* (* (* (+ .cse8 5) .cse4) .cse4) .cse4))) (let ((.cse2 (+ (* 12 (div (+ (* .cse5 (- 1)) .cse7 .cse3 (* .cse6 (- 1))) (- 12))) (* v_prenex_3 v_prenex_3) (* (* (* (* (* .cse10 v_prenex_3) v_prenex_3) v_prenex_3) v_prenex_3) v_prenex_3))) (.cse1 (+ (* (* (* .cse8 v_prenex_3) v_prenex_3) v_prenex_3) (* (* (* (* .cse9 v_prenex_3) v_prenex_3) v_prenex_3) v_prenex_3) (* 12 (* (* (* .cse3 .cse4) .cse4) .cse4))))) (or (= .cse1 .cse2) (= .cse2 .cse1) (= .cse3 (* v_prenex_2 .cse4)) (not (= (mod (+ (* .cse5 11) (* .cse6 11) .cse7 .cse3) (- 12)) 0))))))) .cse11) (or (forall ((main_~k~0 Int) (v_main_~y~0_BEFORE_CALL_8 Int)) (let ((.cse18 (* v_main_~y~0_BEFORE_CALL_8 5)) (.cse16 (* v_main_~y~0_BEFORE_CALL_8 (- 2))) (.cse17 (* v_main_~y~0_BEFORE_CALL_8 6)) (.cse19 (+ v_main_~y~0_BEFORE_CALL_8 1))) (let ((.cse12 (* (* (* (* (+ .cse17 6) .cse19) .cse19) .cse19) .cse19)) (.cse14 (* (* (* (* (* (+ .cse16 (- 2)) .cse19) .cse19) .cse19) .cse19) .cse19)) (.cse13 (* (* (* (+ .cse18 5) .cse19) .cse19) .cse19)) (.cse15 (* .cse19 .cse19))) (or (not (= (mod (+ (* .cse12 11) (* .cse13 11) .cse14 .cse15) (- 12)) 0)) (= (+ (* 12 (div (+ (* .cse12 (- 1)) .cse14 .cse15 (* .cse13 (- 1))) (- 12))) (* v_main_~y~0_BEFORE_CALL_8 v_main_~y~0_BEFORE_CALL_8) (* (* (* (* (* .cse16 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8)) (+ (* (* (* (* .cse17 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* (* (* .cse18 v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) v_main_~y~0_BEFORE_CALL_8) (* 12 (* (* (* .cse15 .cse19) .cse19) .cse19)))) (= .cse15 (* main_~k~0 .cse19)))))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| 1)) .cse11))) is different from true [2019-11-07 00:37:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 4 refuted. 3 times theorem prover too weak. 3 trivial. 7 not checked. [2019-11-07 00:37:35,255 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622759244] [2019-11-07 00:37:35,255 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:37:35,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797286368] [2019-11-07 00:37:35,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1935595676] [2019-11-07 00:37:35,263 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 29 [2019-11-07 00:37:35,300 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:37:35,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:37:35,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:37:35,475 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 12 root evaluator evaluations with a maximum evaluation depth of 16. Performed 12 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Never found a fixpoint. Largest state had 5 variables. [2019-11-07 00:37:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:35,480 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:37:35,480 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:37:35,481 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2019-11-07 00:37:35,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848154954] [2019-11-07 00:37:35,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-07 00:37:35,482 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:37:35,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-07 00:37:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=169, Unknown=5, NotChecked=150, Total=380 [2019-11-07 00:37:35,483 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2019-11-07 00:37:37,864 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 136 DAG size of output: 7 [2019-11-07 00:37:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:37:38,077 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-07 00:37:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:37:38,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-11-07 00:37:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:37:38,082 INFO L225 Difference]: With dead ends: 34 [2019-11-07 00:37:38,082 INFO L226 Difference]: Without dead ends: 28 [2019-11-07 00:37:38,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=79, Invalid=242, Unknown=5, NotChecked=180, Total=506 [2019-11-07 00:37:38,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-07 00:37:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-07 00:37:38,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 00:37:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-07 00:37:38,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 28 [2019-11-07 00:37:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:37:38,104 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-07 00:37:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-07 00:37:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-07 00:37:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 00:37:38,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:37:38,106 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:37:38,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:37:38,311 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:37:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:37:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 787245325, now seen corresponding path program 2 times [2019-11-07 00:37:38,312 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:37:38,312 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739019223] [2019-11-07 00:37:38,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:37:38,319 ERROR L268 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-07 00:37:38,319 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978518679] [2019-11-07 00:37:38,320 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 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 [2019-11-07 00:37:38,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-07 00:37:38,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:37:38,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 00:37:38,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:37:38,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:37:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-07 00:37:38,481 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:37:43,320 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-07 00:37:43,463 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-07 00:37:43,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:37:45,505 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((main_~k~0 Int)) (or (< (+ c_main_~c~0 1) main_~k~0) (let ((.cse0 (+ c_main_~y~0 1))) (= (* main_~k~0 .cse0) (* .cse0 .cse0))) (<= main_~k~0 c_main_~c~0))) (not (= 0 (mod (+ (* (* (* (* (* (* c_main_~y~0 (- 2)) c_main_~y~0) c_main_~y~0) c_main_~y~0) c_main_~y~0) c_main_~y~0) (* (* (* (* (* c_main_~y~0 5) c_main_~y~0) c_main_~y~0) c_main_~y~0) 11) (* c_main_~y~0 c_main_~y~0) (* (* (* (* (* (* c_main_~y~0 6) c_main_~y~0) c_main_~y~0) c_main_~y~0) c_main_~y~0) 11)) (- 12))))) is different from false [2019-11-07 00:37:45,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms