java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/toy2.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:31,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:31,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:31,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:31,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:31,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:31,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:31,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:31,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:31,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:31,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:31,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:31,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:31,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:31,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:31,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:31,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:31,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:31,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:31,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:31,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:31,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:31,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:31,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:31,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:31,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:31,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:31,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:31,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:31,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:31,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:31,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:31,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:31,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:31,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:31,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:31,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:31,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:31,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:31,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:31,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:31,335 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:50:31,349 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:31,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:31,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:31,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:31,352 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:31,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:31,352 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:31,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:31,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:31,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:31,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:31,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:31,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:31,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:31,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:31,354 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:31,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:31,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:31,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:31,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:31,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:31,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:31,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:31,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:31,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:31,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:31,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:31,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:31,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:31,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:31,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:31,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:31,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:31,705 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:31,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy2.cil.c [2019-10-14 23:50:31,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9cf7adc/f5de7e08e11c48b299c2d1915cd76dbb/FLAGd59bd6ceb [2019-10-14 23:50:32,307 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:32,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy2.cil.c [2019-10-14 23:50:32,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9cf7adc/f5de7e08e11c48b299c2d1915cd76dbb/FLAGd59bd6ceb [2019-10-14 23:50:32,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9cf7adc/f5de7e08e11c48b299c2d1915cd76dbb [2019-10-14 23:50:32,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:32,612 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:32,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:32,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:32,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:32,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449a522b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:32, skipping insertion in model container [2019-10-14 23:50:32,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:32" (1/1) ... [2019-10-14 23:50:32,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:32,688 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:33,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:33,042 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:33,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:33,198 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:33,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33 WrapperNode [2019-10-14 23:50:33,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:33,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:33,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:33,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:33,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... [2019-10-14 23:50:33,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:33,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:33,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:33,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:33,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:33,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-14 23:50:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-14 23:50:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-14 23:50:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-14 23:50:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-14 23:50:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:33,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:33,305 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:33,305 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-14 23:50:33,305 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-14 23:50:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-14 23:50:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-14 23:50:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:50:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:33,308 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:33,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:34,020 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:34,021 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:50:34,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:34 BoogieIcfgContainer [2019-10-14 23:50:34,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:34,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:34,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:34,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:34,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:32" (1/3) ... [2019-10-14 23:50:34,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257cb55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:34, skipping insertion in model container [2019-10-14 23:50:34,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:33" (2/3) ... [2019-10-14 23:50:34,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257cb55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:34, skipping insertion in model container [2019-10-14 23:50:34,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:34" (3/3) ... [2019-10-14 23:50:34,032 INFO L109 eAbstractionObserver]: Analyzing ICFG toy2.cil.c [2019-10-14 23:50:34,042 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:34,053 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:34,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:34,109 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:34,109 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:34,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:34,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:34,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:34,110 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:34,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:34,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-10-14 23:50:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:34,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:34,151 INFO L380 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] [2019-10-14 23:50:34,152 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:34,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1201692838, now seen corresponding path program 1 times [2019-10-14 23:50:34,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:34,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961358531] [2019-10-14 23:50:34,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,670 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:50:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:34,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961358531] [2019-10-14 23:50:34,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:34,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:34,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135200631] [2019-10-14 23:50:34,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:34,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:34,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:34,753 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 5 states. [2019-10-14 23:50:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:36,364 INFO L93 Difference]: Finished difference Result 487 states and 852 transitions. [2019-10-14 23:50:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:36,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:50:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:36,383 INFO L225 Difference]: With dead ends: 487 [2019-10-14 23:50:36,383 INFO L226 Difference]: Without dead ends: 332 [2019-10-14 23:50:36,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:36,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-14 23:50:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 294. [2019-10-14 23:50:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-14 23:50:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 485 transitions. [2019-10-14 23:50:36,492 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 485 transitions. Word has length 46 [2019-10-14 23:50:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:36,493 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 485 transitions. [2019-10-14 23:50:36,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 485 transitions. [2019-10-14 23:50:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:36,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:36,498 INFO L380 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] [2019-10-14 23:50:36,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1432311450, now seen corresponding path program 1 times [2019-10-14 23:50:36,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:36,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245801603] [2019-10-14 23:50:36,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:36,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245801603] [2019-10-14 23:50:36,758 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:36,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:36,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552249882] [2019-10-14 23:50:36,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:36,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:36,761 INFO L87 Difference]: Start difference. First operand 294 states and 485 transitions. Second operand 5 states. [2019-10-14 23:50:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:38,023 INFO L93 Difference]: Finished difference Result 833 states and 1372 transitions. [2019-10-14 23:50:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:38,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:50:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:38,032 INFO L225 Difference]: With dead ends: 833 [2019-10-14 23:50:38,032 INFO L226 Difference]: Without dead ends: 565 [2019-10-14 23:50:38,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-14 23:50:38,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 505. [2019-10-14 23:50:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-14 23:50:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 830 transitions. [2019-10-14 23:50:38,106 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 830 transitions. Word has length 46 [2019-10-14 23:50:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:38,107 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 830 transitions. [2019-10-14 23:50:38,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 830 transitions. [2019-10-14 23:50:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:38,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:38,111 INFO L380 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] [2019-10-14 23:50:38,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash -730711576, now seen corresponding path program 1 times [2019-10-14 23:50:38,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:38,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927648540] [2019-10-14 23:50:38,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:38,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927648540] [2019-10-14 23:50:38,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:38,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:38,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788499577] [2019-10-14 23:50:38,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:38,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:38,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:38,305 INFO L87 Difference]: Start difference. First operand 505 states and 830 transitions. Second operand 5 states. [2019-10-14 23:50:38,520 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-14 23:50:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:39,603 INFO L93 Difference]: Finished difference Result 1502 states and 2473 transitions. [2019-10-14 23:50:39,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:39,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:50:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:39,612 INFO L225 Difference]: With dead ends: 1502 [2019-10-14 23:50:39,612 INFO L226 Difference]: Without dead ends: 1025 [2019-10-14 23:50:39,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-10-14 23:50:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 941. [2019-10-14 23:50:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-10-14 23:50:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1556 transitions. [2019-10-14 23:50:39,700 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1556 transitions. Word has length 46 [2019-10-14 23:50:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:39,701 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1556 transitions. [2019-10-14 23:50:39,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1556 transitions. [2019-10-14 23:50:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:39,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:39,705 INFO L380 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] [2019-10-14 23:50:39,705 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash -708079322, now seen corresponding path program 1 times [2019-10-14 23:50:39,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:39,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557690153] [2019-10-14 23:50:39,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:39,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557690153] [2019-10-14 23:50:39,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:39,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:39,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988492391] [2019-10-14 23:50:39,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:39,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:39,842 INFO L87 Difference]: Start difference. First operand 941 states and 1556 transitions. Second operand 4 states. [2019-10-14 23:50:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:40,792 INFO L93 Difference]: Finished difference Result 2489 states and 4048 transitions. [2019-10-14 23:50:40,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:40,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-14 23:50:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:40,806 INFO L225 Difference]: With dead ends: 2489 [2019-10-14 23:50:40,807 INFO L226 Difference]: Without dead ends: 1580 [2019-10-14 23:50:40,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-10-14 23:50:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1468. [2019-10-14 23:50:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2019-10-14 23:50:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2387 transitions. [2019-10-14 23:50:41,003 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2387 transitions. Word has length 46 [2019-10-14 23:50:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:41,004 INFO L462 AbstractCegarLoop]: Abstraction has 1468 states and 2387 transitions. [2019-10-14 23:50:41,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2387 transitions. [2019-10-14 23:50:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:41,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:41,008 INFO L380 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] [2019-10-14 23:50:41,009 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1217552412, now seen corresponding path program 1 times [2019-10-14 23:50:41,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:41,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402180429] [2019-10-14 23:50:41,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:41,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:41,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:41,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402180429] [2019-10-14 23:50:41,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:41,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:41,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869270915] [2019-10-14 23:50:41,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:41,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:41,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:41,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:41,247 INFO L87 Difference]: Start difference. First operand 1468 states and 2387 transitions. Second operand 4 states. [2019-10-14 23:50:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:42,291 INFO L93 Difference]: Finished difference Result 4169 states and 6907 transitions. [2019-10-14 23:50:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:42,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-14 23:50:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:42,311 INFO L225 Difference]: With dead ends: 4169 [2019-10-14 23:50:42,311 INFO L226 Difference]: Without dead ends: 2735 [2019-10-14 23:50:42,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2019-10-14 23:50:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2532. [2019-10-14 23:50:42,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2532 states. [2019-10-14 23:50:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 4179 transitions. [2019-10-14 23:50:42,583 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 4179 transitions. Word has length 46 [2019-10-14 23:50:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:42,584 INFO L462 AbstractCegarLoop]: Abstraction has 2532 states and 4179 transitions. [2019-10-14 23:50:42,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 4179 transitions. [2019-10-14 23:50:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:42,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,587 INFO L380 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] [2019-10-14 23:50:42,587 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1587238149, now seen corresponding path program 1 times [2019-10-14 23:50:42,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054440873] [2019-10-14 23:50:42,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:42,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054440873] [2019-10-14 23:50:42,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:42,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:42,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045258759] [2019-10-14 23:50:42,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:42,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:42,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:42,722 INFO L87 Difference]: Start difference. First operand 2532 states and 4179 transitions. Second operand 5 states. [2019-10-14 23:50:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:43,748 INFO L93 Difference]: Finished difference Result 5600 states and 9175 transitions. [2019-10-14 23:50:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:43,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:50:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:43,768 INFO L225 Difference]: With dead ends: 5600 [2019-10-14 23:50:43,769 INFO L226 Difference]: Without dead ends: 3121 [2019-10-14 23:50:43,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:50:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2019-10-14 23:50:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 2871. [2019-10-14 23:50:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2871 states. [2019-10-14 23:50:44,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 4710 transitions. [2019-10-14 23:50:44,008 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 4710 transitions. Word has length 46 [2019-10-14 23:50:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:44,008 INFO L462 AbstractCegarLoop]: Abstraction has 2871 states and 4710 transitions. [2019-10-14 23:50:44,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:44,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 4710 transitions. [2019-10-14 23:50:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:44,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:44,011 INFO L380 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] [2019-10-14 23:50:44,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:44,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:44,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1136286267, now seen corresponding path program 1 times [2019-10-14 23:50:44,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:44,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698953288] [2019-10-14 23:50:44,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:44,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:44,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:44,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698953288] [2019-10-14 23:50:44,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:44,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:44,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320930044] [2019-10-14 23:50:44,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:44,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:44,136 INFO L87 Difference]: Start difference. First operand 2871 states and 4710 transitions. Second operand 5 states. [2019-10-14 23:50:44,503 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 23:50:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:45,306 INFO L93 Difference]: Finished difference Result 5954 states and 9818 transitions. [2019-10-14 23:50:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:45,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:50:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:45,326 INFO L225 Difference]: With dead ends: 5954 [2019-10-14 23:50:45,326 INFO L226 Difference]: Without dead ends: 3125 [2019-10-14 23:50:45,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2019-10-14 23:50:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2875. [2019-10-14 23:50:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-10-14 23:50:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4646 transitions. [2019-10-14 23:50:45,634 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4646 transitions. Word has length 46 [2019-10-14 23:50:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:45,635 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 4646 transitions. [2019-10-14 23:50:45,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4646 transitions. [2019-10-14 23:50:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:45,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:45,639 INFO L380 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] [2019-10-14 23:50:45,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash 318637817, now seen corresponding path program 1 times [2019-10-14 23:50:45,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:45,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451219820] [2019-10-14 23:50:45,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:45,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451219820] [2019-10-14 23:50:45,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:45,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:45,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136635143] [2019-10-14 23:50:45,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:45,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:45,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:45,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:45,784 INFO L87 Difference]: Start difference. First operand 2875 states and 4646 transitions. Second operand 5 states. [2019-10-14 23:50:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:46,950 INFO L93 Difference]: Finished difference Result 6688 states and 10746 transitions. [2019-10-14 23:50:46,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:46,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:50:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:46,972 INFO L225 Difference]: With dead ends: 6688 [2019-10-14 23:50:46,973 INFO L226 Difference]: Without dead ends: 3863 [2019-10-14 23:50:46,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2019-10-14 23:50:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3581. [2019-10-14 23:50:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3581 states. [2019-10-14 23:50:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5764 transitions. [2019-10-14 23:50:47,234 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5764 transitions. Word has length 46 [2019-10-14 23:50:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:47,235 INFO L462 AbstractCegarLoop]: Abstraction has 3581 states and 5764 transitions. [2019-10-14 23:50:47,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5764 transitions. [2019-10-14 23:50:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:47,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:47,236 INFO L380 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] [2019-10-14 23:50:47,237 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1370305925, now seen corresponding path program 1 times [2019-10-14 23:50:47,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:47,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282755610] [2019-10-14 23:50:47,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:47,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282755610] [2019-10-14 23:50:47,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:47,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682542707] [2019-10-14 23:50:47,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:47,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:47,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:47,370 INFO L87 Difference]: Start difference. First operand 3581 states and 5764 transitions. Second operand 4 states. [2019-10-14 23:50:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:48,157 INFO L93 Difference]: Finished difference Result 7654 states and 12385 transitions. [2019-10-14 23:50:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:48,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-14 23:50:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:48,183 INFO L225 Difference]: With dead ends: 7654 [2019-10-14 23:50:48,183 INFO L226 Difference]: Without dead ends: 4139 [2019-10-14 23:50:48,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2019-10-14 23:50:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 3896. [2019-10-14 23:50:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-10-14 23:50:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 6157 transitions. [2019-10-14 23:50:48,457 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 6157 transitions. Word has length 46 [2019-10-14 23:50:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:48,457 INFO L462 AbstractCegarLoop]: Abstraction has 3896 states and 6157 transitions. [2019-10-14 23:50:48,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 6157 transitions. [2019-10-14 23:50:48,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:50:48,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:48,458 INFO L380 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] [2019-10-14 23:50:48,459 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1336313469, now seen corresponding path program 1 times [2019-10-14 23:50:48,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:48,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634048165] [2019-10-14 23:50:48,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:48,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634048165] [2019-10-14 23:50:48,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:48,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:48,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596748359] [2019-10-14 23:50:48,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:48,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:48,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:48,582 INFO L87 Difference]: Start difference. First operand 3896 states and 6157 transitions. Second operand 4 states. [2019-10-14 23:50:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:49,628 INFO L93 Difference]: Finished difference Result 8673 states and 13916 transitions. [2019-10-14 23:50:49,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:49,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-14 23:50:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:49,662 INFO L225 Difference]: With dead ends: 8673 [2019-10-14 23:50:49,662 INFO L226 Difference]: Without dead ends: 4813 [2019-10-14 23:50:49,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2019-10-14 23:50:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4436. [2019-10-14 23:50:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4436 states. [2019-10-14 23:50:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4436 states to 4436 states and 6943 transitions. [2019-10-14 23:50:50,103 INFO L78 Accepts]: Start accepts. Automaton has 4436 states and 6943 transitions. Word has length 46 [2019-10-14 23:50:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:50,103 INFO L462 AbstractCegarLoop]: Abstraction has 4436 states and 6943 transitions. [2019-10-14 23:50:50,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4436 states and 6943 transitions. [2019-10-14 23:50:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-14 23:50:50,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:50,111 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:50,111 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:50,112 INFO L82 PathProgramCache]: Analyzing trace with hash 168007946, now seen corresponding path program 1 times [2019-10-14 23:50:50,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:50,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382517679] [2019-10-14 23:50:50,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:50,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:50,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382517679] [2019-10-14 23:50:50,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184960001] [2019-10-14 23:50:50,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:50,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:50,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:50:50,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:50,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-10-14 23:50:50,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463803282] [2019-10-14 23:50:50,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:50,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:50,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:50,491 INFO L87 Difference]: Start difference. First operand 4436 states and 6943 transitions. Second operand 3 states. [2019-10-14 23:50:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:50,951 INFO L93 Difference]: Finished difference Result 9948 states and 15938 transitions. [2019-10-14 23:50:50,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:50,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-14 23:50:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:50,980 INFO L225 Difference]: With dead ends: 9948 [2019-10-14 23:50:50,980 INFO L226 Difference]: Without dead ends: 3229 [2019-10-14 23:50:51,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2019-10-14 23:50:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3211. [2019-10-14 23:50:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3211 states. [2019-10-14 23:50:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 4905 transitions. [2019-10-14 23:50:51,276 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 4905 transitions. Word has length 80 [2019-10-14 23:50:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:51,277 INFO L462 AbstractCegarLoop]: Abstraction has 3211 states and 4905 transitions. [2019-10-14 23:50:51,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 4905 transitions. [2019-10-14 23:50:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-14 23:50:51,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:51,297 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:51,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:51,503 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 342871604, now seen corresponding path program 1 times [2019-10-14 23:50:51,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:51,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043818389] [2019-10-14 23:50:51,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,757 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:50:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-14 23:50:51,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043818389] [2019-10-14 23:50:51,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680429002] [2019-10-14 23:50:51,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:52,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:50:52,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-14 23:50:52,137 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:52,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-14 23:50:52,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442212648] [2019-10-14 23:50:52,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:52,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:52,139 INFO L87 Difference]: Start difference. First operand 3211 states and 4905 transitions. Second operand 9 states. [2019-10-14 23:50:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:55,286 INFO L93 Difference]: Finished difference Result 11482 states and 18309 transitions. [2019-10-14 23:50:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:50:55,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-14 23:50:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:55,324 INFO L225 Difference]: With dead ends: 11482 [2019-10-14 23:50:55,324 INFO L226 Difference]: Without dead ends: 8295 [2019-10-14 23:50:55,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:50:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8295 states. [2019-10-14 23:50:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8295 to 6562. [2019-10-14 23:50:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6562 states. [2019-10-14 23:50:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 9883 transitions. [2019-10-14 23:50:56,093 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 9883 transitions. Word has length 121 [2019-10-14 23:50:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:56,095 INFO L462 AbstractCegarLoop]: Abstraction has 6562 states and 9883 transitions. [2019-10-14 23:50:56,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:50:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 9883 transitions. [2019-10-14 23:50:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-14 23:50:56,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:56,121 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:56,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:56,325 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:56,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash 814112889, now seen corresponding path program 1 times [2019-10-14 23:50:56,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:56,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717030290] [2019-10-14 23:50:56,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 23:50:56,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717030290] [2019-10-14 23:50:56,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:56,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:50:56,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947708649] [2019-10-14 23:50:56,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:50:56,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:56,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:50:56,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:56,601 INFO L87 Difference]: Start difference. First operand 6562 states and 9883 transitions. Second operand 8 states. [2019-10-14 23:50:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:59,140 INFO L93 Difference]: Finished difference Result 20165 states and 30880 transitions. [2019-10-14 23:50:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:59,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-10-14 23:50:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:59,191 INFO L225 Difference]: With dead ends: 20165 [2019-10-14 23:50:59,191 INFO L226 Difference]: Without dead ends: 13612 [2019-10-14 23:50:59,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:50:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13612 states. [2019-10-14 23:51:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13612 to 10772. [2019-10-14 23:51:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10772 states. [2019-10-14 23:51:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10772 states to 10772 states and 16414 transitions. [2019-10-14 23:51:00,316 INFO L78 Accepts]: Start accepts. Automaton has 10772 states and 16414 transitions. Word has length 123 [2019-10-14 23:51:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:00,317 INFO L462 AbstractCegarLoop]: Abstraction has 10772 states and 16414 transitions. [2019-10-14 23:51:00,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:51:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 10772 states and 16414 transitions. [2019-10-14 23:51:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-14 23:51:00,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:00,365 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:00,366 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1390782380, now seen corresponding path program 1 times [2019-10-14 23:51:00,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:00,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139745043] [2019-10-14 23:51:00,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:00,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:00,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,529 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:51:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-14 23:51:00,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139745043] [2019-10-14 23:51:00,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513301637] [2019-10-14 23:51:00,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:00,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:51:00,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:51:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:51:00,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:51:00,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-14 23:51:00,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505721117] [2019-10-14 23:51:00,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:51:00,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:51:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:51:00,917 INFO L87 Difference]: Start difference. First operand 10772 states and 16414 transitions. Second operand 3 states. [2019-10-14 23:51:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:01,818 INFO L93 Difference]: Finished difference Result 24980 states and 39939 transitions. [2019-10-14 23:51:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:01,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-14 23:51:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:01,879 INFO L225 Difference]: With dead ends: 24980 [2019-10-14 23:51:01,879 INFO L226 Difference]: Without dead ends: 14264 [2019-10-14 23:51:01,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:51:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14264 states.