java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-examples/relax_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e-m [2018-01-31 08:18:15,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:18:15,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:18:15,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:18:15,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:18:15,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:18:15,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:18:15,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:18:15,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:18:15,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:18:15,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:18:15,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:18:15,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:18:15,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:18:15,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:18:15,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:18:15,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:18:15,945 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:18:15,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:18:15,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:18:15,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:18:15,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:18:15,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:18:15,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:18:15,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:18:15,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:18:15,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:18:15,949 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:18:15,950 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:18:15,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:18:15,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:18:15,950 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:18:15,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:18:15,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:18:15,956 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:18:15,956 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:18:15,956 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:18:15,956 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:18:15,956 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:18:15,956 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:18:15,956 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:18:15,956 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-31 08:18:15,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:18:15,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:18:15,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:18:15,958 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:18:15,959 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:18:15,959 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:18:15,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:18:15,983 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:18:15,985 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:18:15,986 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:18:15,986 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:18:15,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/relax_true-unreach-call.i [2018-01-31 08:18:16,075 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:18:16,076 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:18:16,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:16,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:18:16,080 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:18:16,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e7cd40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16, skipping insertion in model container [2018-01-31 08:18:16,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,091 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:16,114 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:16,188 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:16,203 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:16,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16 WrapperNode [2018-01-31 08:18:16,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:16,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:18:16,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:18:16,209 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:18:16,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... [2018-01-31 08:18:16,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:18:16,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:18:16,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:18:16,230 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:18:16,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (1/1) ... No working directory specified, using /home/daniel/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 [2018-01-31 08:18:16,272 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:18:16,272 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:18:16,272 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-31 08:18:16,272 INFO L136 BoogieDeclarations]: Found implementation of procedure is_relaxed_prefix [2018-01-31 08:18:16,272 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:18:16,272 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:18:16,272 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:18:16,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:18:16,272 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure is_relaxed_prefix [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:18:16,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:18:16,906 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:18:16,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:16 BoogieIcfgContainer [2018-01-31 08:18:16,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:18:16,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:18:16,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:18:16,917 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:18:16,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:18:16" (1/3) ... [2018-01-31 08:18:16,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44608259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:16, skipping insertion in model container [2018-01-31 08:18:16,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:16" (2/3) ... [2018-01-31 08:18:16,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44608259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:16, skipping insertion in model container [2018-01-31 08:18:16,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:16" (3/3) ... [2018-01-31 08:18:16,919 INFO L107 eAbstractionObserver]: Analyzing ICFG relax_true-unreach-call.i [2018-01-31 08:18:16,924 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:18:16,929 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-31 08:18:16,955 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:18:16,955 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:18:16,955 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:18:16,955 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:18:16,955 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:18:16,955 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:18:16,955 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:18:16,955 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:18:16,956 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:18:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-31 08:18:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-31 08:18:16,970 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:16,971 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:16,971 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:18:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -122706779, now seen corresponding path program 1 times [2018-01-31 08:18:16,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:16,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:17,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:17,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:17,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:17,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:17,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:18:17,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 08:18:17,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 08:18:17,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 08:18:17,078 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-31 08:18:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:17,157 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2018-01-31 08:18:17,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 08:18:17,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-01-31 08:18:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:17,165 INFO L225 Difference]: With dead ends: 231 [2018-01-31 08:18:17,165 INFO L226 Difference]: Without dead ends: 122 [2018-01-31 08:18:17,167 INFO L554 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 [2018-01-31 08:18:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-31 08:18:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-31 08:18:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-31 08:18:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2018-01-31 08:18:17,193 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 33 [2018-01-31 08:18:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:17,193 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2018-01-31 08:18:17,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 08:18:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2018-01-31 08:18:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 08:18:17,194 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:17,194 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:17,194 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:18:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2010333717, now seen corresponding path program 1 times [2018-01-31 08:18:17,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:17,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:17,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:17,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:17,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:17,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:17,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:17,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:17,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:17,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:17,303 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand 4 states. [2018-01-31 08:18:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:17,385 INFO L93 Difference]: Finished difference Result 162 states and 186 transitions. [2018-01-31 08:18:17,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:18:17,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-31 08:18:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:17,387 INFO L225 Difference]: With dead ends: 162 [2018-01-31 08:18:17,387 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:18:17,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:18:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-01-31 08:18:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 08:18:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2018-01-31 08:18:17,393 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 35 [2018-01-31 08:18:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:17,394 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2018-01-31 08:18:17,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-01-31 08:18:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:18:17,394 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:17,395 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:17,395 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:18:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -364773807, now seen corresponding path program 1 times [2018-01-31 08:18:17,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:17,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:17,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:17,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:17,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:17,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:17,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:18:17,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:17,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:17,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:17,514 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 6 states. [2018-01-31 08:18:17,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:17,708 INFO L93 Difference]: Finished difference Result 218 states and 253 transitions. [2018-01-31 08:18:17,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:18:17,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-31 08:18:17,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:17,710 INFO L225 Difference]: With dead ends: 218 [2018-01-31 08:18:17,710 INFO L226 Difference]: Without dead ends: 152 [2018-01-31 08:18:17,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:18:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-31 08:18:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2018-01-31 08:18:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-31 08:18:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2018-01-31 08:18:17,720 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 40 [2018-01-31 08:18:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:17,720 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2018-01-31 08:18:17,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2018-01-31 08:18:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:18:17,721 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:17,721 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:17,721 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:18:17,721 INFO L82 PathProgramCache]: Analyzing trace with hash -994820171, now seen corresponding path program 1 times [2018-01-31 08:18:17,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:17,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:17,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:17,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:17,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:17,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:17,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:18:17,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:17,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:17,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:17,970 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand 6 states. [2018-01-31 08:18:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:18,360 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2018-01-31 08:18:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:18:18,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-31 08:18:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:18,373 INFO L225 Difference]: With dead ends: 172 [2018-01-31 08:18:18,373 INFO L226 Difference]: Without dead ends: 157 [2018-01-31 08:18:18,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:18:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-31 08:18:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2018-01-31 08:18:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-31 08:18:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2018-01-31 08:18:18,386 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 41 [2018-01-31 08:18:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:18,387 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2018-01-31 08:18:18,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2018-01-31 08:18:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-31 08:18:18,388 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:18,388 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:18,388 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:18:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1508122895, now seen corresponding path program 1 times [2018-01-31 08:18:18,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:18,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:18,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:18,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:18,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:18,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:18,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:18,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:18,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:18,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:18,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:18,541 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand 4 states. [2018-01-31 08:18:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:18,551 INFO L93 Difference]: Finished difference Result 181 states and 206 transitions. [2018-01-31 08:18:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:18:18,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-31 08:18:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:18,553 INFO L225 Difference]: With dead ends: 181 [2018-01-31 08:18:18,553 INFO L226 Difference]: Without dead ends: 133 [2018-01-31 08:18:18,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-31 08:18:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2018-01-31 08:18:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-31 08:18:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2018-01-31 08:18:18,557 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 46 [2018-01-31 08:18:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:18,557 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2018-01-31 08:18:18,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2018-01-31 08:18:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-31 08:18:18,559 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:18,559 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:18,559 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:18:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1371989496, now seen corresponding path program 1 times [2018-01-31 08:18:18,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:18,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:18,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:18,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:18,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:18,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:21,286 WARN L146 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 36 DAG size of output 12 [2018-01-31 08:18:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:21,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:21,305 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:21,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:21,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:25,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:25,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-01-31 08:18:25,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:18:25,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:18:25,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=171, Unknown=2, NotChecked=0, Total=210 [2018-01-31 08:18:25,518 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 15 states. [2018-01-31 08:18:31,848 WARN L146 SmtUtils]: Spent 4110ms on a formula simplification. DAG size of input: 34 DAG size of output 15 [2018-01-31 08:18:33,884 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_main_~pat_len~11 4294967296)))) (and (= c_main_~j~13 0) (<= (+ .cse0 1) c_main_~pat_len~11) (= 1 c_main_~j~12) (= 0 c_main_~j~13) (<= (mod c_main_~pat_len~11 4294967296) 1) (<= (mod c_main_~a_len~11 4294967296) 0) (or (<= (+ (* 1073741824 (div (* 4 c_main_~a_len~11) 4294967296)) 536870912) c_main_~a_len~11) (<= (+ (* 4294967296 (div (+ c_main_~a_len~11 1) 4294967296)) c_main_~pat_len~11) (+ .cse0 (* 4294967296 (div c_main_~a_len~11 4294967296)) 1))))) is different from false [2018-01-31 08:19:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:09,797 INFO L93 Difference]: Finished difference Result 298 states and 343 transitions. [2018-01-31 08:19:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:19:09,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-01-31 08:19:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:09,810 INFO L225 Difference]: With dead ends: 298 [2018-01-31 08:19:09,810 INFO L226 Difference]: Without dead ends: 226 [2018-01-31 08:19:09,810 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=4, NotChecked=40, Total=506 [2018-01-31 08:19:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-01-31 08:19:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 162. [2018-01-31 08:19:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-31 08:19:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2018-01-31 08:19:09,816 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 48 [2018-01-31 08:19:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:09,816 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2018-01-31 08:19:09,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:19:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2018-01-31 08:19:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 08:19:09,817 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:09,817 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:19:09,817 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:19:09,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1042234603, now seen corresponding path program 1 times [2018-01-31 08:19:09,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:09,818 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:09,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:09,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:09,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:09,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:10,187 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 25 DAG size of output 14 [2018-01-31 08:19:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:19:10,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:10,343 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:19:10,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:10,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:19:10,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:19:10,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2018-01-31 08:19:10,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:19:10,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:19:10,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:19:10,439 INFO L87 Difference]: Start difference. First operand 162 states and 185 transitions. Second operand 16 states. [2018-01-31 08:19:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:11,280 INFO L93 Difference]: Finished difference Result 329 states and 373 transitions. [2018-01-31 08:19:11,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:19:11,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-01-31 08:19:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:11,281 INFO L225 Difference]: With dead ends: 329 [2018-01-31 08:19:11,281 INFO L226 Difference]: Without dead ends: 283 [2018-01-31 08:19:11,282 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:19:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-01-31 08:19:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 212. [2018-01-31 08:19:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-01-31 08:19:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-01-31 08:19:11,297 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 52 [2018-01-31 08:19:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:11,297 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-01-31 08:19:11,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:19:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-01-31 08:19:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:19:11,298 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:11,298 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:19:11,298 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:19:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1203784783, now seen corresponding path program 1 times [2018-01-31 08:19:11,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:11,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:11,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:11,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:11,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:11,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:11,753 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 32 DAG size of output 22 [2018-01-31 08:19:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:19:11,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:11,961 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:19:11,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:11,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:19:12,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:12,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-01-31 08:19:12,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:19:12,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:19:12,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:19:12,140 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 19 states. [2018-01-31 08:19:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:14,052 INFO L93 Difference]: Finished difference Result 482 states and 558 transitions. [2018-01-31 08:19:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:19:14,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2018-01-31 08:19:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:14,054 INFO L225 Difference]: With dead ends: 482 [2018-01-31 08:19:14,054 INFO L226 Difference]: Without dead ends: 410 [2018-01-31 08:19:14,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:19:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-01-31 08:19:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 242. [2018-01-31 08:19:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-31 08:19:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 276 transitions. [2018-01-31 08:19:14,072 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 276 transitions. Word has length 56 [2018-01-31 08:19:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:14,072 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 276 transitions. [2018-01-31 08:19:14,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:19:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 276 transitions. [2018-01-31 08:19:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:19:14,077 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:14,078 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:19:14,078 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:19:14,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1076851009, now seen corresponding path program 2 times [2018-01-31 08:19:14,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:14,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:14,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:14,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:14,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:14,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:14,342 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 29 DAG size of output 3 [2018-01-31 08:19:14,480 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 40 DAG size of output 14 [2018-01-31 08:19:20,799 WARN L146 SmtUtils]: Spent 4269ms on a formula simplification. DAG size of input: 44 DAG size of output 38 [2018-01-31 08:19:22,957 WARN L146 SmtUtils]: Spent 2091ms on a formula simplification. DAG size of input: 38 DAG size of output 24 [2018-01-31 08:19:32,322 WARN L146 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 18 DAG size of output 11 [2018-01-31 08:19:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:19:32,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:32,335 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:19:32,342 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:19:32,351 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:32,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:32,357 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:19:32,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:19:32,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2018-01-31 08:19:32,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:19:32,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:19:32,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=408, Unknown=3, NotChecked=0, Total=462 [2018-01-31 08:19:32,878 INFO L87 Difference]: Start difference. First operand 242 states and 276 transitions. Second operand 22 states. [2018-01-31 08:19:47,860 WARN L146 SmtUtils]: Spent 4193ms on a formula simplification. DAG size of input: 47 DAG size of output 41 [2018-01-31 08:20:04,560 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 36 DAG size of output 32 [2018-01-31 08:20:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:14,760 INFO L93 Difference]: Finished difference Result 445 states and 520 transitions. [2018-01-31 08:20:14,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:20:14,762 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-01-31 08:20:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:14,763 INFO L225 Difference]: With dead ends: 445 [2018-01-31 08:20:14,763 INFO L226 Difference]: Without dead ends: 365 [2018-01-31 08:20:14,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=129, Invalid=1058, Unknown=3, NotChecked=0, Total=1190 [2018-01-31 08:20:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-01-31 08:20:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 257. [2018-01-31 08:20:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-01-31 08:20:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2018-01-31 08:20:14,774 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 56 [2018-01-31 08:20:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:14,775 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2018-01-31 08:20:14,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:20:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2018-01-31 08:20:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 08:20:14,775 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:14,775 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:14,776 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:14,776 INFO L82 PathProgramCache]: Analyzing trace with hash -514442101, now seen corresponding path program 1 times [2018-01-31 08:20:14,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:14,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:14,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:14,776 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:14,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:14,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:14,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:14,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:14,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:20:14,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:20:14,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:20:14,838 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand 3 states. [2018-01-31 08:20:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:14,931 INFO L93 Difference]: Finished difference Result 367 states and 416 transitions. [2018-01-31 08:20:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:20:14,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-01-31 08:20:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:14,932 INFO L225 Difference]: With dead ends: 367 [2018-01-31 08:20:14,932 INFO L226 Difference]: Without dead ends: 287 [2018-01-31 08:20:14,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:20:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-31 08:20:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 280. [2018-01-31 08:20:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-01-31 08:20:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 315 transitions. [2018-01-31 08:20:14,943 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 315 transitions. Word has length 57 [2018-01-31 08:20:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:14,943 INFO L432 AbstractCegarLoop]: Abstraction has 280 states and 315 transitions. [2018-01-31 08:20:14,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:20:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 315 transitions. [2018-01-31 08:20:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:20:14,944 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:14,944 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:14,944 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1840501111, now seen corresponding path program 1 times [2018-01-31 08:20:14,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:14,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:14,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:14,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:14,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:14,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:15,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:15,281 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:15,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:15,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:15,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:15,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2018-01-31 08:20:15,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:20:15,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:20:15,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:20:15,397 INFO L87 Difference]: Start difference. First operand 280 states and 315 transitions. Second operand 12 states. [2018-01-31 08:20:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:15,811 INFO L93 Difference]: Finished difference Result 394 states and 449 transitions. [2018-01-31 08:20:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:20:15,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-01-31 08:20:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:15,812 INFO L225 Difference]: With dead ends: 394 [2018-01-31 08:20:15,812 INFO L226 Difference]: Without dead ends: 366 [2018-01-31 08:20:15,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:20:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-01-31 08:20:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 252. [2018-01-31 08:20:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-01-31 08:20:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2018-01-31 08:20:15,821 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 69 [2018-01-31 08:20:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:15,821 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2018-01-31 08:20:15,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:20:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2018-01-31 08:20:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 08:20:15,822 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:15,822 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:15,822 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1030979484, now seen corresponding path program 1 times [2018-01-31 08:20:15,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:15,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:15,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:15,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:15,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:15,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:16,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:16,248 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:16,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:16,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:16,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:16,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-01-31 08:20:16,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-31 08:20:16,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-31 08:20:16,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:20:16,552 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand 29 states. [2018-01-31 08:20:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:18,906 INFO L93 Difference]: Finished difference Result 732 states and 851 transitions. [2018-01-31 08:20:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-31 08:20:18,907 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-01-31 08:20:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:18,908 INFO L225 Difference]: With dead ends: 732 [2018-01-31 08:20:18,908 INFO L226 Difference]: Without dead ends: 624 [2018-01-31 08:20:18,909 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=332, Invalid=3328, Unknown=0, NotChecked=0, Total=3660 [2018-01-31 08:20:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-01-31 08:20:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 294. [2018-01-31 08:20:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-01-31 08:20:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 331 transitions. [2018-01-31 08:20:18,923 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 331 transitions. Word has length 74 [2018-01-31 08:20:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:18,924 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 331 transitions. [2018-01-31 08:20:18,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-31 08:20:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 331 transitions. [2018-01-31 08:20:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-31 08:20:18,926 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:18,926 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:18,926 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 118354930, now seen corresponding path program 2 times [2018-01-31 08:20:18,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:18,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:18,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:18,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:18,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:18,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:19,430 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:19,430 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:19,434 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:20:19,443 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:19,450 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:19,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 08:20:19,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:20:19,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2018-01-31 08:20:19,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:20:19,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:20:19,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:20:19,538 INFO L87 Difference]: Start difference. First operand 294 states and 331 transitions. Second operand 18 states. [2018-01-31 08:20:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:20,075 INFO L93 Difference]: Finished difference Result 529 states and 614 transitions. [2018-01-31 08:20:20,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:20:20,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2018-01-31 08:20:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:20,077 INFO L225 Difference]: With dead ends: 529 [2018-01-31 08:20:20,077 INFO L226 Difference]: Without dead ends: 492 [2018-01-31 08:20:20,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:20:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-01-31 08:20:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 298. [2018-01-31 08:20:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-01-31 08:20:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 334 transitions. [2018-01-31 08:20:20,087 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 334 transitions. Word has length 74 [2018-01-31 08:20:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:20,087 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 334 transitions. [2018-01-31 08:20:20,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:20:20,087 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 334 transitions. [2018-01-31 08:20:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-31 08:20:20,088 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:20,088 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:20,088 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash -239931771, now seen corresponding path program 1 times [2018-01-31 08:20:20,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:20,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:20,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:20,089 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:20,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:20,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:20,426 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 23 DAG size of output 13 [2018-01-31 08:20:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:20:20,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:20,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:20:20,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:20:20,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:20:20,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:20:20,448 INFO L87 Difference]: Start difference. First operand 298 states and 334 transitions. Second operand 4 states. [2018-01-31 08:20:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:20,754 INFO L93 Difference]: Finished difference Result 345 states and 387 transitions. [2018-01-31 08:20:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:20:20,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-01-31 08:20:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:20,755 INFO L225 Difference]: With dead ends: 345 [2018-01-31 08:20:20,755 INFO L226 Difference]: Without dead ends: 316 [2018-01-31 08:20:20,755 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:20:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-01-31 08:20:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 302. [2018-01-31 08:20:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-31 08:20:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 339 transitions. [2018-01-31 08:20:20,766 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 339 transitions. Word has length 82 [2018-01-31 08:20:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:20,766 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 339 transitions. [2018-01-31 08:20:20,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:20:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 339 transitions. [2018-01-31 08:20:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-31 08:20:20,767 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:20,767 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:20,767 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1722595556, now seen corresponding path program 1 times [2018-01-31 08:20:20,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:20,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:20,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:20,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:20,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:20,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:20,991 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 15 DAG size of output 14 [2018-01-31 08:20:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-31 08:20:21,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:21,013 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:21,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:21,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 08:20:21,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:20:21,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-01-31 08:20:21,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:20:21,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:20:21,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:20:21,108 INFO L87 Difference]: Start difference. First operand 302 states and 339 transitions. Second operand 10 states. [2018-01-31 08:20:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:21,257 INFO L93 Difference]: Finished difference Result 409 states and 462 transitions. [2018-01-31 08:20:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:20:21,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-01-31 08:20:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:21,258 INFO L225 Difference]: With dead ends: 409 [2018-01-31 08:20:21,258 INFO L226 Difference]: Without dead ends: 366 [2018-01-31 08:20:21,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:20:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-01-31 08:20:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 306. [2018-01-31 08:20:21,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-01-31 08:20:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 344 transitions. [2018-01-31 08:20:21,270 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 344 transitions. Word has length 82 [2018-01-31 08:20:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:21,270 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 344 transitions. [2018-01-31 08:20:21,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:20:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 344 transitions. [2018-01-31 08:20:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-31 08:20:21,271 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:21,271 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:21,271 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1094370839, now seen corresponding path program 1 times [2018-01-31 08:20:21,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:21,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:21,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:21,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:21,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:21,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:21,667 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 23 DAG size of output 15 [2018-01-31 08:20:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:21,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:21,714 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:21,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:21,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 08:20:21,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:21,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-01-31 08:20:21,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:20:21,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:20:21,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:20:21,828 INFO L87 Difference]: Start difference. First operand 306 states and 344 transitions. Second operand 12 states. [2018-01-31 08:20:22,203 WARN L143 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-31 08:20:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:22,502 INFO L93 Difference]: Finished difference Result 382 states and 429 transitions. [2018-01-31 08:20:22,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:20:22,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-01-31 08:20:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:22,503 INFO L225 Difference]: With dead ends: 382 [2018-01-31 08:20:22,503 INFO L226 Difference]: Without dead ends: 371 [2018-01-31 08:20:22,503 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:20:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-31 08:20:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 308. [2018-01-31 08:20:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-31 08:20:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 345 transitions. [2018-01-31 08:20:22,513 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 345 transitions. Word has length 85 [2018-01-31 08:20:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:22,514 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 345 transitions. [2018-01-31 08:20:22,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:20:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 345 transitions. [2018-01-31 08:20:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 08:20:22,514 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:22,515 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:22,515 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1352534218, now seen corresponding path program 1 times [2018-01-31 08:20:22,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:22,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:22,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:22,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:22,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:22,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:22,847 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 17 DAG size of output 11 [2018-01-31 08:20:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:20:22,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:22,904 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:22,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:22,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:20:23,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:23,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2018-01-31 08:20:23,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:20:23,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:20:23,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:20:23,115 INFO L87 Difference]: Start difference. First operand 308 states and 345 transitions. Second operand 19 states. [2018-01-31 08:20:24,090 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 15 DAG size of output 13 [2018-01-31 08:20:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:24,159 INFO L93 Difference]: Finished difference Result 500 states and 559 transitions. [2018-01-31 08:20:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:20:24,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2018-01-31 08:20:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:24,164 INFO L225 Difference]: With dead ends: 500 [2018-01-31 08:20:24,164 INFO L226 Difference]: Without dead ends: 369 [2018-01-31 08:20:24,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-01-31 08:20:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-01-31 08:20:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 261. [2018-01-31 08:20:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-01-31 08:20:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 292 transitions. [2018-01-31 08:20:24,174 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 292 transitions. Word has length 93 [2018-01-31 08:20:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:24,174 INFO L432 AbstractCegarLoop]: Abstraction has 261 states and 292 transitions. [2018-01-31 08:20:24,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:20:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 292 transitions. [2018-01-31 08:20:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-31 08:20:24,175 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:24,175 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:24,175 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2108452289, now seen corresponding path program 1 times [2018-01-31 08:20:24,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:24,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:24,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:24,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:24,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:24,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:20:24,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:24,973 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:24,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:25,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:25,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:20:25,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:20:25,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-31 08:20:25,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2018-01-31 08:20:25,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-01-31 08:20:25,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-31 08:20:25,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2018-01-31 08:20:25,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:25,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:25,432 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:4 [2018-01-31 08:20:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:20:25,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:25,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2018-01-31 08:20:25,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 08:20:25,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 08:20:25,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:20:25,476 INFO L87 Difference]: Start difference. First operand 261 states and 292 transitions. Second operand 35 states. [2018-01-31 08:20:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:27,296 INFO L93 Difference]: Finished difference Result 462 states and 523 transitions. [2018-01-31 08:20:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:20:27,296 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 95 [2018-01-31 08:20:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:27,297 INFO L225 Difference]: With dead ends: 462 [2018-01-31 08:20:27,297 INFO L226 Difference]: Without dead ends: 420 [2018-01-31 08:20:27,298 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=379, Invalid=2377, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:20:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-01-31 08:20:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 302. [2018-01-31 08:20:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-31 08:20:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 339 transitions. [2018-01-31 08:20:27,320 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 339 transitions. Word has length 95 [2018-01-31 08:20:27,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:27,320 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 339 transitions. [2018-01-31 08:20:27,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 08:20:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 339 transitions. [2018-01-31 08:20:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-01-31 08:20:27,321 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:27,321 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:27,321 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash -496175025, now seen corresponding path program 1 times [2018-01-31 08:20:27,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:27,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:27,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:27,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:27,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:27,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-01-31 08:20:27,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:27,653 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:27,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:27,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:20:27,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:27,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 17 [2018-01-31 08:20:27,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:20:27,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:20:27,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:20:27,901 INFO L87 Difference]: Start difference. First operand 302 states and 339 transitions. Second operand 17 states. [2018-01-31 08:20:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:28,425 INFO L93 Difference]: Finished difference Result 769 states and 876 transitions. [2018-01-31 08:20:28,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:20:28,426 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2018-01-31 08:20:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:28,428 INFO L225 Difference]: With dead ends: 769 [2018-01-31 08:20:28,428 INFO L226 Difference]: Without dead ends: 739 [2018-01-31 08:20:28,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:20:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-01-31 08:20:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 398. [2018-01-31 08:20:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-01-31 08:20:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 446 transitions. [2018-01-31 08:20:28,446 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 446 transitions. Word has length 98 [2018-01-31 08:20:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:28,446 INFO L432 AbstractCegarLoop]: Abstraction has 398 states and 446 transitions. [2018-01-31 08:20:28,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:20:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 446 transitions. [2018-01-31 08:20:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-31 08:20:28,447 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:28,447 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:28,447 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2113247596, now seen corresponding path program 1 times [2018-01-31 08:20:28,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:28,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:28,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:28,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:28,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:28,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:20:29,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:29,039 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:29,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:29,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:30,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-31 08:20:30,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:30,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2018-01-31 08:20:30,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:20:30,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:20:30,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:20:30,666 INFO L87 Difference]: Start difference. First operand 398 states and 446 transitions. Second operand 22 states. [2018-01-31 08:20:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:43,852 INFO L93 Difference]: Finished difference Result 886 states and 999 transitions. [2018-01-31 08:20:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-31 08:20:43,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-01-31 08:20:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:43,854 INFO L225 Difference]: With dead ends: 886 [2018-01-31 08:20:43,854 INFO L226 Difference]: Without dead ends: 668 [2018-01-31 08:20:43,854 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=204, Invalid=1516, Unknown=2, NotChecked=0, Total=1722 [2018-01-31 08:20:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-01-31 08:20:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 442. [2018-01-31 08:20:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-01-31 08:20:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 497 transitions. [2018-01-31 08:20:43,872 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 497 transitions. Word has length 100 [2018-01-31 08:20:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:43,872 INFO L432 AbstractCegarLoop]: Abstraction has 442 states and 497 transitions. [2018-01-31 08:20:43,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:20:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 497 transitions. [2018-01-31 08:20:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-31 08:20:43,873 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:43,873 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:43,873 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1873535289, now seen corresponding path program 1 times [2018-01-31 08:20:43,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:43,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:43,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:43,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:43,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:43,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:20:44,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:44,010 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:44,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:44,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:44,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-31 08:20:44,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:20:44,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:11, output treesize:1 [2018-01-31 08:20:44,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-31 08:20:44,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-31 08:20:44,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-31 08:20:44,215 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-31 08:20:44,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:44,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-01-31 08:20:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:20:44,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:44,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-01-31 08:20:44,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:20:44,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:20:44,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:20:44,264 INFO L87 Difference]: Start difference. First operand 442 states and 497 transitions. Second operand 24 states. [2018-01-31 08:20:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:45,637 INFO L93 Difference]: Finished difference Result 1300 states and 1478 transitions. [2018-01-31 08:20:45,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-31 08:20:45,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 103 [2018-01-31 08:20:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:45,639 INFO L225 Difference]: With dead ends: 1300 [2018-01-31 08:20:45,639 INFO L226 Difference]: Without dead ends: 1125 [2018-01-31 08:20:45,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=492, Invalid=3048, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:20:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-01-31 08:20:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 526. [2018-01-31 08:20:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-01-31 08:20:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 609 transitions. [2018-01-31 08:20:45,664 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 609 transitions. Word has length 103 [2018-01-31 08:20:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:45,664 INFO L432 AbstractCegarLoop]: Abstraction has 526 states and 609 transitions. [2018-01-31 08:20:45,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:20:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 609 transitions. [2018-01-31 08:20:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-31 08:20:45,665 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:45,665 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:45,665 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1086248457, now seen corresponding path program 1 times [2018-01-31 08:20:45,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:45,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:45,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:45,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:45,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:45,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:45,974 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:20:45,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:45,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:45,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:46,002 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:20:46,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:46,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2018-01-31 08:20:46,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:20:46,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:20:46,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:20:46,563 INFO L87 Difference]: Start difference. First operand 526 states and 609 transitions. Second operand 24 states. [2018-01-31 08:20:48,050 WARN L146 SmtUtils]: Spent 698ms on a formula simplification. DAG size of input: 39 DAG size of output 20 [2018-01-31 08:20:51,443 WARN L146 SmtUtils]: Spent 1297ms on a formula simplification. DAG size of input: 38 DAG size of output 28 [2018-01-31 08:20:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:51,982 INFO L93 Difference]: Finished difference Result 855 states and 998 transitions. [2018-01-31 08:20:51,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-31 08:20:51,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 105 [2018-01-31 08:20:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:51,985 INFO L225 Difference]: With dead ends: 855 [2018-01-31 08:20:51,985 INFO L226 Difference]: Without dead ends: 804 [2018-01-31 08:20:51,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=260, Invalid=2189, Unknown=1, NotChecked=0, Total=2450 [2018-01-31 08:20:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-01-31 08:20:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 554. [2018-01-31 08:20:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-01-31 08:20:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 633 transitions. [2018-01-31 08:20:52,010 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 633 transitions. Word has length 105 [2018-01-31 08:20:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:52,010 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 633 transitions. [2018-01-31 08:20:52,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:20:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 633 transitions. [2018-01-31 08:20:52,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-31 08:20:52,011 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:52,011 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:52,011 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -259762394, now seen corresponding path program 1 times [2018-01-31 08:20:52,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:52,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:52,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:52,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:52,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:52,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-31 08:20:52,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:52,170 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:52,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:52,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-31 08:20:52,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:20:52,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-01-31 08:20:52,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:20:52,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:20:52,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:20:52,295 INFO L87 Difference]: Start difference. First operand 554 states and 633 transitions. Second operand 15 states. [2018-01-31 08:20:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:52,682 INFO L93 Difference]: Finished difference Result 1052 states and 1213 transitions. [2018-01-31 08:20:52,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:20:52,691 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 113 [2018-01-31 08:20:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:52,693 INFO L225 Difference]: With dead ends: 1052 [2018-01-31 08:20:52,693 INFO L226 Difference]: Without dead ends: 664 [2018-01-31 08:20:52,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:20:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-01-31 08:20:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 554. [2018-01-31 08:20:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-01-31 08:20:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 627 transitions. [2018-01-31 08:20:52,719 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 627 transitions. Word has length 113 [2018-01-31 08:20:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:52,719 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 627 transitions. [2018-01-31 08:20:52,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:20:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 627 transitions. [2018-01-31 08:20:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-01-31 08:20:52,720 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:52,720 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:52,720 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash -814401557, now seen corresponding path program 1 times [2018-01-31 08:20:52,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:52,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:52,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:52,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:52,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:52,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:53,335 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 54 DAG size of output 31 [2018-01-31 08:20:53,793 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:20:53,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:53,793 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:53,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:53,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:53,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:20:53,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:20:53,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:53,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:53,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:53,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-31 08:20:54,313 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-31 08:20:54,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2018-01-31 08:20:54,338 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:20:54,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-31 08:20:54,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:54,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:54,357 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:20:54,357 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:20:54,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 55 [2018-01-31 08:20:54,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,411 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:20:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-31 08:20:54,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:54,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:116, output treesize:4 [2018-01-31 08:20:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:20:54,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:54,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 47 [2018-01-31 08:20:54,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-31 08:20:54,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-31 08:20:54,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1996, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:20:54,586 INFO L87 Difference]: Start difference. First operand 554 states and 627 transitions. Second operand 47 states. [2018-01-31 08:20:55,010 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 08:20:57,580 WARN L146 SmtUtils]: Spent 688ms on a formula simplification. DAG size of input: 45 DAG size of output 43 [2018-01-31 08:20:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:57,626 INFO L93 Difference]: Finished difference Result 1039 states and 1164 transitions. [2018-01-31 08:20:57,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 08:20:57,626 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 118 [2018-01-31 08:20:57,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:57,628 INFO L225 Difference]: With dead ends: 1039 [2018-01-31 08:20:57,628 INFO L226 Difference]: Without dead ends: 971 [2018-01-31 08:20:57,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=820, Invalid=6836, Unknown=0, NotChecked=0, Total=7656 [2018-01-31 08:20:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-01-31 08:20:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 586. [2018-01-31 08:20:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-01-31 08:20:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 663 transitions. [2018-01-31 08:20:57,658 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 663 transitions. Word has length 118 [2018-01-31 08:20:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:57,658 INFO L432 AbstractCegarLoop]: Abstraction has 586 states and 663 transitions. [2018-01-31 08:20:57,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-31 08:20:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 663 transitions. [2018-01-31 08:20:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-31 08:20:57,659 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:57,659 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:57,659 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-31 08:20:57,660 INFO L82 PathProgramCache]: Analyzing trace with hash 404892672, now seen corresponding path program 1 times [2018-01-31 08:20:57,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:57,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:57,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:57,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:57,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:57,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-31 08:20:58,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:58,413 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:20:58,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:58,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:58,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-31 08:20:58,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:20:58,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:1 [2018-01-31 08:20:58,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-31 08:20:58,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-01-31 08:20:58,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-31 08:20:58,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 3 [2018-01-31 08:20:58,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:58,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-01-31 08:20:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:20:58,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:58,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 46 [2018-01-31 08:20:58,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 08:20:58,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 08:20:58,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 08:20:58,893 INFO L87 Difference]: Start difference. First operand 586 states and 663 transitions. Second operand 46 states. Received shutdown request... [2018-01-31 08:20:59,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:20:59,167 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:20:59,171 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:20:59,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:20:59 BoogieIcfgContainer [2018-01-31 08:20:59,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:20:59,172 INFO L168 Benchmark]: Toolchain (without parser) took 163096.10 ms. Allocated memory was 149.4 MB in the beginning and 323.0 MB in the end (delta: 173.5 MB). Free memory was 112.9 MB in the beginning and 116.3 MB in the end (delta: -3.4 MB). Peak memory consumption was 170.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:59,173 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:20:59,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 131.60 ms. Allocated memory is still 149.4 MB. Free memory was 112.9 MB in the beginning and 100.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:59,173 INFO L168 Benchmark]: Boogie Preprocessor took 20.71 ms. Allocated memory is still 149.4 MB. Free memory was 100.2 MB in the beginning and 98.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:59,173 INFO L168 Benchmark]: RCFGBuilder took 677.00 ms. Allocated memory is still 149.4 MB. Free memory was 98.0 MB in the beginning and 70.1 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:59,173 INFO L168 Benchmark]: TraceAbstraction took 162256.78 ms. Allocated memory was 149.4 MB in the beginning and 323.0 MB in the end (delta: 173.5 MB). Free memory was 124.3 MB in the beginning and 116.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 181.5 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:59,174 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 149.4 MB. Free memory is still 119.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 131.60 ms. Allocated memory is still 149.4 MB. Free memory was 112.9 MB in the beginning and 100.2 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.71 ms. Allocated memory is still 149.4 MB. Free memory was 100.2 MB in the beginning and 98.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 5.3 GB. * RCFGBuilder took 677.00 ms. Allocated memory is still 149.4 MB. Free memory was 98.0 MB in the beginning and 70.1 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 162256.78 ms. Allocated memory was 149.4 MB in the beginning and 323.0 MB in the end (delta: 173.5 MB). Free memory was 124.3 MB in the beginning and 116.3 MB in the end (delta: 8.0 MB). Peak memory consumption was 181.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 8]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 8). Cancelled while BasicCegarLoop was constructing difference of abstraction (586states) and interpolant automaton (currently 13 states, 46 states before enhancement), while ReachableStatesComputation was computing reachable states (111 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 127 locations, 1 error locations. TIMEOUT Result, 162.2s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 121.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3645 SDtfs, 9975 SDslu, 34262 SDs, 0 SdLazy, 12148 SolverSat, 604 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 84.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2163 GetRequests, 1428 SyntacticMatches, 55 SemanticMatches, 680 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7590 ImplicationChecksByTransitivity, 71.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 3350 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 3420 NumberOfCodeBlocks, 3370 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3377 ConstructedInterpolants, 68 QuantifiedInterpolants, 2189227 SizeOfPredicates, 197 NumberOfNonLiveVariables, 3192 ConjunctsInSsa, 459 ConjunctsInUnsatCore, 43 InterpolantComputations, 12 PerfectInterpolantSequences, 354/680 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-20-59-180.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/relax_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-20-59-180.csv Completed graceful shutdown