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 -i ../../../trunk/examples/svcomp/nla-digbench/prodbin.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:36:41,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:36:41,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:36:41,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:36:41,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:36:41,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:36:41,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:36:41,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:36:41,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:36:41,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:36:41,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:36:41,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:36:41,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:36:41,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:36:41,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:36:41,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:36:41,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:36:41,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:36:41,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:36:41,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:36:41,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:36:41,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:36:41,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:36:41,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:36:41,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:36:41,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:36:41,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:36:41,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:36:41,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:36:41,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:36:41,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:36:41,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:36:41,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:36:41,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:36:41,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:36:41,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:36:41,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:36:41,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:36:41,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:36:41,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:36:41,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:36:41,200 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-10-02 11:36:41,216 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:36:41,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:36:41,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:36:41,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:36:41,218 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:36:41,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:36:41,219 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:36:41,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:36:41,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:36:41,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:36:41,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:36:41,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:36:41,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:36:41,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:36:41,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:36:41,221 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:36:41,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:36:41,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:36:41,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:36:41,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:36:41,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:36:41,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:36:41,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:36:41,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:36:41,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:36:41,223 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:36:41,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:36:41,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:36:41,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:36:41,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:36:41,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:36:41,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:36:41,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:36:41,297 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:36:41,298 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prodbin.c [2019-10-02 11:36:41,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc8d29c5/7b4fb8ac8ba44d709149629976982c00/FLAGf0747edac [2019-10-02 11:36:41,887 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:36:41,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin.c [2019-10-02 11:36:41,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc8d29c5/7b4fb8ac8ba44d709149629976982c00/FLAGf0747edac [2019-10-02 11:36:42,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc8d29c5/7b4fb8ac8ba44d709149629976982c00 [2019-10-02 11:36:42,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:36:42,295 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:36:42,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:36:42,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:36:42,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:36:42,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e99115e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42, skipping insertion in model container [2019-10-02 11:36:42,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,313 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:36:42,330 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:36:42,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:36:42,533 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:36:42,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:36:42,665 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:36:42,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42 WrapperNode [2019-10-02 11:36:42,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:36:42,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:36:42,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:36:42,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:36:42,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (1/1) ... [2019-10-02 11:36:42,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:36:42,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:36:42,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:36:42,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:36:42,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (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-10-02 11:36:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:36:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:36:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:36:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:36:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:36:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2019-10-02 11:36:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 11:36:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:36:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:36:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:36:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:36:42,977 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:36:42,977 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:36:42,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:36:42 BoogieIcfgContainer [2019-10-02 11:36:42,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:36:42,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:36:42,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:36:42,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:36:42,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:36:42" (1/3) ... [2019-10-02 11:36:42,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c19f088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:36:42, skipping insertion in model container [2019-10-02 11:36:42,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:36:42" (2/3) ... [2019-10-02 11:36:42,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c19f088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:36:42, skipping insertion in model container [2019-10-02 11:36:43,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:36:42" (3/3) ... [2019-10-02 11:36:43,008 INFO L109 eAbstractionObserver]: Analyzing ICFG prodbin.c [2019-10-02 11:36:43,042 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:36:43,061 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:36:43,103 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:36:43,140 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:36:43,141 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:36:43,141 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:36:43,142 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:36:43,142 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:36:43,142 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:36:43,142 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:36:43,142 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:36:43,142 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:36:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-02 11:36:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:36:43,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:43,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:43,165 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1560104174, now seen corresponding path program 1 times [2019-10-02 11:36:43,172 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:43,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:43,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:43,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:43,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:36:43,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:36:43,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:36:43,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:36:43,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:36:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:36:43,313 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-10-02 11:36:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:43,339 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-02 11:36:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:36:43,341 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-02 11:36:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:43,352 INFO L225 Difference]: With dead ends: 39 [2019-10-02 11:36:43,352 INFO L226 Difference]: Without dead ends: 17 [2019-10-02 11:36:43,356 INFO L640 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-10-02 11:36:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-02 11:36:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-02 11:36:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-02 11:36:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-02 11:36:43,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-10-02 11:36:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:43,407 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-02 11:36:43,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:36:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-02 11:36:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:36:43,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:43,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:43,409 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1561891634, now seen corresponding path program 1 times [2019-10-02 11:36:43,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:43,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:43,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:43,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:43,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:43,419 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:43,420 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:43,420 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:36:43,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:43,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:36:43,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:43,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:36:43,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:36:43,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:36:43,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:36:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:36:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:36:43,625 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 5 states. [2019-10-02 11:36:43,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:43,729 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-02 11:36:43,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:36:43,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-02 11:36:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:43,731 INFO L225 Difference]: With dead ends: 33 [2019-10-02 11:36:43,731 INFO L226 Difference]: Without dead ends: 26 [2019-10-02 11:36:43,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:36:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-02 11:36:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-02 11:36:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-02 11:36:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-02 11:36:43,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2019-10-02 11:36:43,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:43,742 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-02 11:36:43,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:36:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-02 11:36:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:36:43,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:43,743 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:43,744 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:43,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1038075816, now seen corresponding path program 1 times [2019-10-02 11:36:43,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:43,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:43,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:43,752 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:43,753 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:43,753 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:36:43,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:43,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:36:43,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:43,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:36:43,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:43,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-10-02 11:36:43,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:36:43,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:36:43,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:36:43,991 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-10-02 11:36:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:44,204 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-10-02 11:36:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:36:44,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-02 11:36:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:44,207 INFO L225 Difference]: With dead ends: 39 [2019-10-02 11:36:44,207 INFO L226 Difference]: Without dead ends: 37 [2019-10-02 11:36:44,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:36:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-02 11:36:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-10-02 11:36:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 11:36:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-02 11:36:44,217 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 19 [2019-10-02 11:36:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:44,217 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-02 11:36:44,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:36:44,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-02 11:36:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:36:44,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:44,219 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:44,219 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1481884118, now seen corresponding path program 1 times [2019-10-02 11:36:44,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:44,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:44,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:44,227 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:44,227 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:44,227 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-10-02 11:36:44,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:44,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 11:36:44,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:44,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:36:44,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:44,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-10-02 11:36:44,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:36:44,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:36:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:36:44,446 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 7 states. [2019-10-02 11:36:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:44,579 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-10-02 11:36:44,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:36:44,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-02 11:36:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:44,583 INFO L225 Difference]: With dead ends: 49 [2019-10-02 11:36:44,584 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 11:36:44,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:36:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 11:36:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-10-02 11:36:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:36:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-02 11:36:44,593 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2019-10-02 11:36:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:44,594 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-02 11:36:44,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:36:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-02 11:36:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:36:44,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:44,595 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:44,596 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 776909625, now seen corresponding path program 1 times [2019-10-02 11:36:44,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:44,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:44,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:44,602 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:44,603 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:44,603 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 11:36:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:44,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:36:44,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:44,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:36:44,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:44,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-10-02 11:36:44,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:36:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:36:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:36:44,775 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 9 states. [2019-10-02 11:36:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:44,899 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2019-10-02 11:36:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:36:44,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-02 11:36:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:44,901 INFO L225 Difference]: With dead ends: 47 [2019-10-02 11:36:44,901 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:36:44,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:36:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:36:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-10-02 11:36:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 11:36:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-02 11:36:44,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2019-10-02 11:36:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:44,910 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-02 11:36:44,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:36:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-02 11:36:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:36:44,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:44,911 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:44,912 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash -775079950, now seen corresponding path program 2 times [2019-10-02 11:36:44,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:44,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:44,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:44,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:44,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:44,918 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:44,918 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:44,919 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-10-02 11:36:44,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:44,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:36:44,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:36:44,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 11:36:44,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:45,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:36:49,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:49,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-10-02 11:36:49,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:36:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:36:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:36:49,617 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2019-10-02 11:36:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:51,956 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-10-02 11:36:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:36:51,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-10-02 11:36:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:51,960 INFO L225 Difference]: With dead ends: 49 [2019-10-02 11:36:51,960 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 11:36:51,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:36:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 11:36:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-02 11:36:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 11:36:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-02 11:36:51,971 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 28 [2019-10-02 11:36:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:51,972 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-02 11:36:51,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:36:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-02 11:36:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:36:51,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:51,975 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:51,975 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:51,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:51,975 INFO L82 PathProgramCache]: Analyzing trace with hash 999927412, now seen corresponding path program 1 times [2019-10-02 11:36:51,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:51,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:36:51,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:51,981 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:51,982 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:51,982 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:52,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:36:52,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 11:36:52,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:52,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:52,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:52,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:52,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:52,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 11:36:52,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:52,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-10-02 11:36:52,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:36:52,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:36:52,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:36:52,442 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2019-10-02 11:36:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:52,883 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-10-02 11:36:52,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:36:52,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-02 11:36:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:52,886 INFO L225 Difference]: With dead ends: 57 [2019-10-02 11:36:52,887 INFO L226 Difference]: Without dead ends: 55 [2019-10-02 11:36:52,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:36:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-02 11:36:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-10-02 11:36:52,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-02 11:36:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-10-02 11:36:52,896 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 28 [2019-10-02 11:36:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:52,897 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2019-10-02 11:36:52,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:36:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2019-10-02 11:36:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:36:52,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:52,898 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:52,898 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1796148304, now seen corresponding path program 2 times [2019-10-02 11:36:52,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:52,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:52,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:36:52,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:52,904 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:52,905 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:52,905 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:36:52,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:36:52,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:36:52,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:36:52,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:53,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:36:53,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:53,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-10-02 11:36:53,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:36:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:36:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:36:53,206 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 9 states. [2019-10-02 11:36:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:53,500 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-10-02 11:36:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:36:53,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-10-02 11:36:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:53,502 INFO L225 Difference]: With dead ends: 62 [2019-10-02 11:36:53,502 INFO L226 Difference]: Without dead ends: 60 [2019-10-02 11:36:53,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:36:53,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-02 11:36:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-10-02 11:36:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:36:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-02 11:36:53,511 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 28 [2019-10-02 11:36:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:53,511 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-02 11:36:53,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:36:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-02 11:36:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:36:53,513 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:53,513 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:53,513 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 389577448, now seen corresponding path program 3 times [2019-10-02 11:36:53,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:53,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:53,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:53,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:36:53,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:53,520 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:53,520 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:53,520 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:53,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:36:53,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 11:36:53,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:36:53,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:36:53,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:53,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:53,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:53,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:36:53,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-10-02 11:36:53,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:36:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:36:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:36:53,884 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2019-10-02 11:36:55,096 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-10-02 11:36:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:55,154 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-10-02 11:36:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:36:55,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-10-02 11:36:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:55,156 INFO L225 Difference]: With dead ends: 74 [2019-10-02 11:36:55,156 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:36:55,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:36:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:36:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-02 11:36:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-02 11:36:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-10-02 11:36:55,163 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-10-02 11:36:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:55,163 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-10-02 11:36:55,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:36:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-10-02 11:36:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:36:55,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:55,165 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:55,165 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1284065066, now seen corresponding path program 2 times [2019-10-02 11:36:55,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:55,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:55,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:36:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:55,176 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:55,177 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:55,177 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:55,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:36:55,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:36:55,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:36:55,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:36:55,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:55,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:36:55,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:36:55,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-10-02 11:36:55,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:36:55,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:36:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:36:55,572 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2019-10-02 11:36:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:36:55,935 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-10-02 11:36:55,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:36:55,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-10-02 11:36:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:36:55,937 INFO L225 Difference]: With dead ends: 54 [2019-10-02 11:36:55,937 INFO L226 Difference]: Without dead ends: 52 [2019-10-02 11:36:55,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:36:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-02 11:36:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-10-02 11:36:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-02 11:36:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-10-02 11:36:55,945 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 37 [2019-10-02 11:36:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:36:55,946 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-10-02 11:36:55,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:36:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-10-02 11:36:55,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 11:36:55,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:36:55,947 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:36:55,948 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:36:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:36:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash 393904434, now seen corresponding path program 3 times [2019-10-02 11:36:55,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:36:55,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:36:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:55,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:36:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:36:55,953 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:36:55,954 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:36:55,954 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:36:55,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:36:56,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-02 11:36:56,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:36:56,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:36:56,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:36:56,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:56,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:57,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:57,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:59,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:36:59,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:01,904 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-10-02 11:37:01,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:01,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 16 proven. 37 refuted. 2 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:37:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:37:06,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-10-02 11:37:06,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:37:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:37:06,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=141, Unknown=5, NotChecked=0, Total=182 [2019-10-02 11:37:06,114 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 14 states. [2019-10-02 11:37:15,206 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-02 11:37:15,953 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 11:37:18,351 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 49 [2019-10-02 11:37:21,732 WARN L191 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-02 11:37:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:37:27,546 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-10-02 11:37:27,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:37:27,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-10-02 11:37:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:37:27,548 INFO L225 Difference]: With dead ends: 63 [2019-10-02 11:37:27,548 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 11:37:27,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=89, Invalid=366, Unknown=7, NotChecked=0, Total=462 [2019-10-02 11:37:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 11:37:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-10-02 11:37:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-02 11:37:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-10-02 11:37:27,558 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 46 [2019-10-02 11:37:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:37:27,558 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-10-02 11:37:27,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:37:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-10-02 11:37:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 11:37:27,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:37:27,560 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:37:27,560 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:37:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:37:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1368789034, now seen corresponding path program 4 times [2019-10-02 11:37:27,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:37:27,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:37:27,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:27,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:37:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:27,566 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:37:27,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:37:27,567 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:37:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 11:37:27,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:37:27,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:37:27,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-02 11:37:27,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:37:28,014 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-10-02 11:37:30,573 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-10-02 11:37:31,031 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-10-02 11:37:31,270 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-10-02 11:37:31,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 12 proven. 70 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 11:37:31,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:37:31,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-10-02 11:37:31,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:37:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:37:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:37:31,555 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 18 states. [2019-10-02 11:37:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:37:33,103 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-10-02 11:37:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 11:37:33,110 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-10-02 11:37:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:37:33,111 INFO L225 Difference]: With dead ends: 72 [2019-10-02 11:37:33,111 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 11:37:33,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:37:33,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 11:37:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-10-02 11:37:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 11:37:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-10-02 11:37:33,127 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 55 [2019-10-02 11:37:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:37:33,127 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-10-02 11:37:33,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:37:33,128 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-10-02 11:37:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 11:37:33,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:37:33,131 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:37:33,131 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:37:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:37:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1447045070, now seen corresponding path program 5 times [2019-10-02 11:37:33,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:37:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:37:33,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:33,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:37:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:33,143 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:37:33,144 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:37:33,144 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:37:33,169 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:37:33,206 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 11:37:33,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:37:33,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-02 11:37:33,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:37:34,241 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-10-02 11:37:34,581 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-10-02 11:37:35,326 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-10-02 11:37:35,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 14 proven. 100 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:37:35,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:37:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-10-02 11:37:35,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:37:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:37:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:37:35,419 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 20 states. [2019-10-02 11:37:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:37:38,686 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-10-02 11:37:38,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:37:38,687 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2019-10-02 11:37:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:37:38,688 INFO L225 Difference]: With dead ends: 81 [2019-10-02 11:37:38,689 INFO L226 Difference]: Without dead ends: 79 [2019-10-02 11:37:38,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:37:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-02 11:37:38,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-10-02 11:37:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-02 11:37:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-10-02 11:37:38,703 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 64 [2019-10-02 11:37:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:37:38,704 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-10-02 11:37:38,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:37:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-10-02 11:37:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 11:37:38,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:37:38,706 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:37:38,706 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:37:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:37:38,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1919064362, now seen corresponding path program 6 times [2019-10-02 11:37:38,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:37:38,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:37:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:38,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:37:38,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:37:38,712 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:37:38,712 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:37:38,712 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:37:38,742 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:37:38,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-02 11:37:38,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:37:38,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 11:37:38,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:37:39,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:39,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:39,486 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-10-02 11:37:40,195 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-10-02 11:37:40,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:40,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:42,130 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-02 11:37:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:46,822 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-10-02 11:37:46,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:46,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:37:55,955 WARN L191 SmtUtils]: Spent 8.42 s on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-10-02 11:37:59,216 WARN L191 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-10-02 11:38:03,730 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 11:38:03,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:38:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:38:15,365 WARN L191 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-02 11:38:15,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:38:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 30 proven. 119 refuted. 14 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 11:38:15,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:38:15,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-10-02 11:38:15,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 11:38:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 11:38:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=301, Unknown=17, NotChecked=0, Total=380 [2019-10-02 11:38:15,462 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2019-10-02 11:38:22,131 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-10-02 11:38:31,883 WARN L191 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-02 11:38:35,553 WARN L191 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-10-02 11:38:39,572 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-10-02 11:38:45,640 WARN L191 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-10-02 11:38:49,899 WARN L191 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-10-02 11:38:54,804 WARN L191 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-02 11:39:04,122 WARN L191 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-10-02 11:39:09,916 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2019-10-02 11:39:22,954 WARN L191 SmtUtils]: Spent 6.66 s on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-10-02 11:39:42,428 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-10-02 11:39:53,081 WARN L191 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-10-02 11:40:16,438 WARN L191 SmtUtils]: Spent 10.57 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-10-02 11:41:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:10,561 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-10-02 11:41:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 11:41:10,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2019-10-02 11:41:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:10,563 INFO L225 Difference]: With dead ends: 90 [2019-10-02 11:41:10,563 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 11:41:10,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 132.6s TimeCoverageRelationStatistics Valid=243, Invalid=1043, Unknown=46, NotChecked=0, Total=1332 [2019-10-02 11:41:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 11:41:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2019-10-02 11:41:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 11:41:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-10-02 11:41:10,575 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 73 [2019-10-02 11:41:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:10,576 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-10-02 11:41:10,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 11:41:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-10-02 11:41:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 11:41:10,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:10,578 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:10,578 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash -67277006, now seen corresponding path program 7 times [2019-10-02 11:41:10,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:10,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:10,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:41:10,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:10,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:41:10,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:41:10,584 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:41:10,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:41:10,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-02 11:41:10,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:41:11,417 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-10-02 11:41:11,728 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-10-02 11:41:11,915 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-10-02 11:41:16,919 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 41 [2019-10-02 11:41:17,365 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-10-02 11:41:18,581 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-02 11:41:18,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 18 proven. 175 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-02 11:41:18,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:41:18,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-10-02 11:41:18,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 11:41:18,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 11:41:18,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=495, Unknown=1, NotChecked=0, Total=552 [2019-10-02 11:41:18,946 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 24 states. [2019-10-02 11:41:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:23,876 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-10-02 11:41:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 11:41:23,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2019-10-02 11:41:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:23,879 INFO L225 Difference]: With dead ends: 99 [2019-10-02 11:41:23,879 INFO L226 Difference]: Without dead ends: 97 [2019-10-02 11:41:23,880 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=67, Invalid=582, Unknown=1, NotChecked=0, Total=650 [2019-10-02 11:41:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-02 11:41:23,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-10-02 11:41:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 11:41:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-10-02 11:41:23,889 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 82 [2019-10-02 11:41:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:23,890 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-10-02 11:41:23,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 11:41:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-10-02 11:41:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 11:41:23,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:23,892 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:23,892 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1501634006, now seen corresponding path program 8 times [2019-10-02 11:41:23,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:23,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:41:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:23,897 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:41:23,897 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:41:23,897 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:41:23,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:41:23,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:41:23,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:41:23,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-02 11:41:23,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:41:25,711 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-02 11:41:25,946 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-02 11:41:26,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 17 proven. 223 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 11:41:26,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:41:26,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-10-02 11:41:26,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 11:41:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 11:41:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-10-02 11:41:26,340 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 26 states. [2019-10-02 11:41:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:41:28,579 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-10-02 11:41:28,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 11:41:28,579 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 91 [2019-10-02 11:41:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:41:28,581 INFO L225 Difference]: With dead ends: 108 [2019-10-02 11:41:28,581 INFO L226 Difference]: Without dead ends: 106 [2019-10-02 11:41:28,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2019-10-02 11:41:28,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-02 11:41:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2019-10-02 11:41:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-02 11:41:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-10-02 11:41:28,594 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 91 [2019-10-02 11:41:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:41:28,595 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-10-02 11:41:28,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 11:41:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-10-02 11:41:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:41:28,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:41:28,596 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:41:28,597 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:41:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:41:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1734130126, now seen corresponding path program 9 times [2019-10-02 11:41:28,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:41:28,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:41:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:28,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:41:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:41:28,608 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-10-02 11:41:28,608 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-10-02 11:41:28,608 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:41:28,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:41:28,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-02 11:41:28,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:41:28,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 11:41:28,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:41:28,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:28,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:28,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:28,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:30,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:34,223 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-10-02 11:41:34,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:34,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:41,997 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-10-02 11:41:41,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:41,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:46,088 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-10-02 11:41:48,090 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-10-02 11:41:48,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:48,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:41:58,813 WARN L191 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-10-02 11:42:18,293 WARN L191 SmtUtils]: Spent 8.85 s on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-02 11:42:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:42:18,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:44:18,802 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-10-02 11:44:19,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-02 11:44:19,005 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2019-10-02 11:44:19,011 INFO L168 Benchmark]: Toolchain (without parser) took 456715.78 ms. Allocated memory was 141.0 MB in the beginning and 270.0 MB in the end (delta: 129.0 MB). Free memory was 88.4 MB in the beginning and 193.1 MB in the end (delta: -104.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:44:19,012 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 141.0 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:44:19,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.05 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 88.2 MB in the beginning and 178.9 MB in the end (delta: -90.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-10-02 11:44:19,013 INFO L168 Benchmark]: Boogie Preprocessor took 37.75 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 176.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-10-02 11:44:19,014 INFO L168 Benchmark]: RCFGBuilder took 273.88 ms. Allocated memory is still 200.3 MB. Free memory was 176.7 MB in the beginning and 164.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:44:19,015 INFO L168 Benchmark]: TraceAbstraction took 456021.57 ms. Allocated memory was 200.3 MB in the beginning and 270.0 MB in the end (delta: 69.7 MB). Free memory was 164.3 MB in the beginning and 193.1 MB in the end (delta: -28.8 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:44:19,024 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 141.0 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 370.05 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 88.2 MB in the beginning and 178.9 MB in the end (delta: -90.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.75 ms. Allocated memory is still 200.3 MB. Free memory was 178.9 MB in the beginning and 176.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 273.88 ms. Allocated memory is still 200.3 MB. Free memory was 176.7 MB in the beginning and 164.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 456021.57 ms. Allocated memory was 200.3 MB in the beginning and 270.0 MB in the end (delta: 69.7 MB). Free memory was 164.3 MB in the beginning and 193.1 MB in the end (delta: -28.8 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...