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/toy1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:50:31,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:50:31,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:50:31,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:50:31,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:50:31,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:50:31,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:50:31,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:50:31,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:50:31,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:50:31,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:50:31,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:50:31,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:50:31,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:50:31,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:50:31,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:50:31,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:50:31,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:50:31,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:50:31,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:50:31,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:50:31,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:50:31,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:50:31,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:50:31,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:50:31,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:50:31,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:50:31,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:50:31,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:50:31,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:50:31,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:50:31,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:50:31,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:50:31,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:50:31,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:50:31,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:50:31,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:50:31,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:50:31,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:50:31,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:50:31,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:50:31,212 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,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:50:31,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:50:31,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:50:31,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:50:31,239 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:50:31,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:50:31,240 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:50:31,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:50:31,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:50:31,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:50:31,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:50:31,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:50:31,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:50:31,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:50:31,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:50:31,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:50:31,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:50:31,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:50:31,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:50:31,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:50:31,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:50:31,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:50:31,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:50:31,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:50:31,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:50:31,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:50:31,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:50:31,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:50:31,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:50:31,529 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:50:31,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:50:31,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:50:31,551 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:50:31,552 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:50:31,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-14 23:50:31,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29be2fa93/e76b133839e9431bbac7ddee09b5069c/FLAGd63efbb7d [2019-10-14 23:50:32,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:50:32,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/toy1.cil.c [2019-10-14 23:50:32,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29be2fa93/e76b133839e9431bbac7ddee09b5069c/FLAGd63efbb7d [2019-10-14 23:50:32,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29be2fa93/e76b133839e9431bbac7ddee09b5069c [2019-10-14 23:50:32,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:50:32,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:50:32,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:32,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:50:32,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:50:32,537 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,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d60e989 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,540 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,548 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:50:32,591 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:50:32,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:32,860 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:50:33,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:50:33,033 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:50:33,033 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,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:50:33,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:50:33,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:50:33,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:50:33,050 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,050 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,064 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,064 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,081 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,101 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,104 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,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:50:33,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:50:33,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:50:33,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:50:33,117 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,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:50:33,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure write_loop [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure compute1 [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure compute2 [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure write_back [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure read [2019-10-14 23:50:33,177 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-14 23:50:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-14 23:50:33,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:50:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:50:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:50:33,178 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-14 23:50:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure write_loop [2019-10-14 23:50:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure compute1 [2019-10-14 23:50:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure compute2 [2019-10-14 23:50:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure write_back [2019-10-14 23:50:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:50:33,179 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-14 23:50:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-14 23:50:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:50:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:50:33,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:50:33,930 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:50:33,931 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-14 23:50:33,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:33 BoogieIcfgContainer [2019-10-14 23:50:33,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:50:33,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:50:33,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:50:33,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:50:33,937 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:33,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b928c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:33, skipping insertion in model container [2019-10-14 23:50:33,938 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:33,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b928c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:33, skipping insertion in model container [2019-10-14 23:50:33,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:33" (3/3) ... [2019-10-14 23:50:33,940 INFO L109 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2019-10-14 23:50:33,951 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:50:33,960 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:50:33,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:50:34,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:50:34,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:50:34,000 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:50:34,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:50:34,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:50:34,001 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:50:34,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:50:34,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:50:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-10-14 23:50:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:34,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:34,036 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, 1] [2019-10-14 23:50:34,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -854031758, now seen corresponding path program 1 times [2019-10-14 23:50:34,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:34,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194175079] [2019-10-14 23:50:34,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:34,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,484 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-14 23:50:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:34,518 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,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194175079] [2019-10-14 23:50:34,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:34,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:34,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143540414] [2019-10-14 23:50:34,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:34,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:34,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:34,545 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-10-14 23:50:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:35,494 INFO L93 Difference]: Finished difference Result 332 states and 575 transitions. [2019-10-14 23:50:35,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:35,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:35,512 INFO L225 Difference]: With dead ends: 332 [2019-10-14 23:50:35,512 INFO L226 Difference]: Without dead ends: 178 [2019-10-14 23:50:35,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 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:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-14 23:50:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2019-10-14 23:50:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-14 23:50:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 245 transitions. [2019-10-14 23:50:35,590 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 245 transitions. Word has length 47 [2019-10-14 23:50:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:35,590 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 245 transitions. [2019-10-14 23:50:35,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 245 transitions. [2019-10-14 23:50:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:35,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:35,594 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, 1] [2019-10-14 23:50:35,594 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash -459664972, now seen corresponding path program 1 times [2019-10-14 23:50:35,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:35,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692359942] [2019-10-14 23:50:35,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:35,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:35,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:35,833 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:35,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692359942] [2019-10-14 23:50:35,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:35,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:35,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935731750] [2019-10-14 23:50:35,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:35,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:35,838 INFO L87 Difference]: Start difference. First operand 152 states and 245 transitions. Second operand 4 states. [2019-10-14 23:50:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:36,486 INFO L93 Difference]: Finished difference Result 314 states and 511 transitions. [2019-10-14 23:50:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:36,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:36,491 INFO L225 Difference]: With dead ends: 314 [2019-10-14 23:50:36,491 INFO L226 Difference]: Without dead ends: 178 [2019-10-14 23:50:36,493 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:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-14 23:50:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2019-10-14 23:50:36,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-14 23:50:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 244 transitions. [2019-10-14 23:50:36,531 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 244 transitions. Word has length 47 [2019-10-14 23:50:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:36,532 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 244 transitions. [2019-10-14 23:50:36,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 244 transitions. [2019-10-14 23:50:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:36,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:36,534 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, 1] [2019-10-14 23:50:36,535 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1591319026, now seen corresponding path program 1 times [2019-10-14 23:50:36,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:36,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679090421] [2019-10-14 23:50:36,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:36,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:36,557 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,740 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,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679090421] [2019-10-14 23:50:36,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:36,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:36,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334594063] [2019-10-14 23:50:36,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:36,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:36,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:36,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:36,743 INFO L87 Difference]: Start difference. First operand 152 states and 244 transitions. Second operand 5 states. [2019-10-14 23:50:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:37,944 INFO L93 Difference]: Finished difference Result 473 states and 771 transitions. [2019-10-14 23:50:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:37,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:37,948 INFO L225 Difference]: With dead ends: 473 [2019-10-14 23:50:37,948 INFO L226 Difference]: Without dead ends: 338 [2019-10-14 23:50:37,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-14 23:50:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 297. [2019-10-14 23:50:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-14 23:50:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 484 transitions. [2019-10-14 23:50:38,022 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 484 transitions. Word has length 47 [2019-10-14 23:50:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:38,023 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 484 transitions. [2019-10-14 23:50:38,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 484 transitions. [2019-10-14 23:50:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:38,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:38,034 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, 1] [2019-10-14 23:50:38,034 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1541564722, now seen corresponding path program 1 times [2019-10-14 23:50:38,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:38,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493571894] [2019-10-14 23:50:38,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:38,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:38,267 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,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493571894] [2019-10-14 23:50:38,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:38,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:38,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642692633] [2019-10-14 23:50:38,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:38,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:38,272 INFO L87 Difference]: Start difference. First operand 297 states and 484 transitions. Second operand 5 states. [2019-10-14 23:50:38,492 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-14 23:50:39,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:39,727 INFO L93 Difference]: Finished difference Result 842 states and 1381 transitions. [2019-10-14 23:50:39,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:39,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:39,732 INFO L225 Difference]: With dead ends: 842 [2019-10-14 23:50:39,732 INFO L226 Difference]: Without dead ends: 571 [2019-10-14 23:50:39,734 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,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-14 23:50:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 508. [2019-10-14 23:50:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-14 23:50:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 829 transitions. [2019-10-14 23:50:39,791 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 829 transitions. Word has length 47 [2019-10-14 23:50:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:39,792 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 829 transitions. [2019-10-14 23:50:39,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 829 transitions. [2019-10-14 23:50:39,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:39,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:39,794 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, 1] [2019-10-14 23:50:39,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:39,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:39,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1816324336, now seen corresponding path program 1 times [2019-10-14 23:50:39,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:39,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473314409] [2019-10-14 23:50:39,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:39,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:39,948 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,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473314409] [2019-10-14 23:50:39,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:39,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:39,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958460016] [2019-10-14 23:50:39,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:39,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:39,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:39,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:39,951 INFO L87 Difference]: Start difference. First operand 508 states and 829 transitions. Second operand 5 states. [2019-10-14 23:50:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:41,413 INFO L93 Difference]: Finished difference Result 1511 states and 2482 transitions. [2019-10-14 23:50:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:50:41,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:41,422 INFO L225 Difference]: With dead ends: 1511 [2019-10-14 23:50:41,422 INFO L226 Difference]: Without dead ends: 1031 [2019-10-14 23:50:41,425 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:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-10-14 23:50:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 944. [2019-10-14 23:50:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-10-14 23:50:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1555 transitions. [2019-10-14 23:50:41,516 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1555 transitions. Word has length 47 [2019-10-14 23:50:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:41,516 INFO L462 AbstractCegarLoop]: Abstraction has 944 states and 1555 transitions. [2019-10-14 23:50:41,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1555 transitions. [2019-10-14 23:50:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:41,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:41,520 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, 1] [2019-10-14 23:50:41,520 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:41,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1777043086, now seen corresponding path program 1 times [2019-10-14 23:50:41,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:41,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861831076] [2019-10-14 23:50:41,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:41,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:41,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:41,667 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,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861831076] [2019-10-14 23:50:41,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:41,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:41,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070576284] [2019-10-14 23:50:41,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:41,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:41,683 INFO L87 Difference]: Start difference. First operand 944 states and 1555 transitions. Second operand 4 states. [2019-10-14 23:50:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:42,714 INFO L93 Difference]: Finished difference Result 2498 states and 4057 transitions. [2019-10-14 23:50:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:42,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:42,729 INFO L225 Difference]: With dead ends: 2498 [2019-10-14 23:50:42,729 INFO L226 Difference]: Without dead ends: 1586 [2019-10-14 23:50:42,735 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:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-10-14 23:50:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1473. [2019-10-14 23:50:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-10-14 23:50:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2390 transitions. [2019-10-14 23:50:42,926 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2390 transitions. Word has length 47 [2019-10-14 23:50:42,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:42,927 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 2390 transitions. [2019-10-14 23:50:42,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2390 transitions. [2019-10-14 23:50:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:42,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:42,932 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, 1] [2019-10-14 23:50:42,932 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash -390839692, now seen corresponding path program 1 times [2019-10-14 23:50:42,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:42,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405831267] [2019-10-14 23:50:42,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:42,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:43,086 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:43,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405831267] [2019-10-14 23:50:43,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:43,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:43,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144693757] [2019-10-14 23:50:43,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:43,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:43,089 INFO L87 Difference]: Start difference. First operand 1473 states and 2390 transitions. Second operand 4 states. [2019-10-14 23:50:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:43,879 INFO L93 Difference]: Finished difference Result 3083 states and 5004 transitions. [2019-10-14 23:50:43,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:43,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:43,889 INFO L225 Difference]: With dead ends: 3083 [2019-10-14 23:50:43,890 INFO L226 Difference]: Without dead ends: 1664 [2019-10-14 23:50:43,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-10-14 23:50:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1563. [2019-10-14 23:50:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-10-14 23:50:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2539 transitions. [2019-10-14 23:50:44,024 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2539 transitions. Word has length 47 [2019-10-14 23:50:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:44,024 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 2539 transitions. [2019-10-14 23:50:44,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2539 transitions. [2019-10-14 23:50:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:44,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:44,027 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, 1] [2019-10-14 23:50:44,027 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:44,028 INFO L82 PathProgramCache]: Analyzing trace with hash 409745528, now seen corresponding path program 1 times [2019-10-14 23:50:44,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:44,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663809352] [2019-10-14 23:50:44,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:44,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:44,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:44,163 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,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663809352] [2019-10-14 23:50:44,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:44,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:44,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255913514] [2019-10-14 23:50:44,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:44,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:44,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:44,166 INFO L87 Difference]: Start difference. First operand 1563 states and 2539 transitions. Second operand 5 states. [2019-10-14 23:50:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:45,286 INFO L93 Difference]: Finished difference Result 3404 states and 5489 transitions. [2019-10-14 23:50:45,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:45,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:45,298 INFO L225 Difference]: With dead ends: 3404 [2019-10-14 23:50:45,298 INFO L226 Difference]: Without dead ends: 1886 [2019-10-14 23:50:45,304 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:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-10-14 23:50:45,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1749. [2019-10-14 23:50:45,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-10-14 23:50:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2806 transitions. [2019-10-14 23:50:45,513 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2806 transitions. Word has length 47 [2019-10-14 23:50:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:45,513 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2806 transitions. [2019-10-14 23:50:45,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2806 transitions. [2019-10-14 23:50:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:45,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:45,516 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, 1] [2019-10-14 23:50:45,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:45,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 628600246, now seen corresponding path program 1 times [2019-10-14 23:50:45,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:45,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715801884] [2019-10-14 23:50:45,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:45,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:45,644 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,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715801884] [2019-10-14 23:50:45,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:45,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:45,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600466681] [2019-10-14 23:50:45,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:45,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:45,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:45,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:45,647 INFO L87 Difference]: Start difference. First operand 1749 states and 2806 transitions. Second operand 5 states. [2019-10-14 23:50:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:46,790 INFO L93 Difference]: Finished difference Result 3592 states and 5770 transitions. [2019-10-14 23:50:46,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:46,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:46,803 INFO L225 Difference]: With dead ends: 3592 [2019-10-14 23:50:46,805 INFO L226 Difference]: Without dead ends: 1894 [2019-10-14 23:50:46,812 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,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-10-14 23:50:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1749. [2019-10-14 23:50:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1749 states. [2019-10-14 23:50:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2756 transitions. [2019-10-14 23:50:47,011 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2756 transitions. Word has length 47 [2019-10-14 23:50:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:47,011 INFO L462 AbstractCegarLoop]: Abstraction has 1749 states and 2756 transitions. [2019-10-14 23:50:47,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:47,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2756 transitions. [2019-10-14 23:50:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:47,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:47,013 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, 1] [2019-10-14 23:50:47,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1051302072, now seen corresponding path program 1 times [2019-10-14 23:50:47,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:47,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224841272] [2019-10-14 23:50:47,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:47,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:47,142 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,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224841272] [2019-10-14 23:50:47,144 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:47,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:47,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108874739] [2019-10-14 23:50:47,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:47,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:47,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:47,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:47,150 INFO L87 Difference]: Start difference. First operand 1749 states and 2756 transitions. Second operand 5 states. [2019-10-14 23:50:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:48,192 INFO L93 Difference]: Finished difference Result 3969 states and 6221 transitions. [2019-10-14 23:50:48,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:50:48,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:50:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:48,205 INFO L225 Difference]: With dead ends: 3969 [2019-10-14 23:50:48,205 INFO L226 Difference]: Without dead ends: 2283 [2019-10-14 23:50:48,212 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:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2019-10-14 23:50:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2138. [2019-10-14 23:50:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-10-14 23:50:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3345 transitions. [2019-10-14 23:50:48,461 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3345 transitions. Word has length 47 [2019-10-14 23:50:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:48,462 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3345 transitions. [2019-10-14 23:50:48,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3345 transitions. [2019-10-14 23:50:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:48,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:48,464 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, 1] [2019-10-14 23:50:48,465 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:48,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:48,465 INFO L82 PathProgramCache]: Analyzing trace with hash 233653622, now seen corresponding path program 1 times [2019-10-14 23:50:48,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:48,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507794406] [2019-10-14 23:50:48,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:48,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:48,629 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,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507794406] [2019-10-14 23:50:48,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:48,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:48,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581825206] [2019-10-14 23:50:48,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:48,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:48,631 INFO L87 Difference]: Start difference. First operand 2138 states and 3345 transitions. Second operand 4 states. [2019-10-14 23:50:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:49,313 INFO L93 Difference]: Finished difference Result 4588 states and 7177 transitions. [2019-10-14 23:50:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:49,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:49,328 INFO L225 Difference]: With dead ends: 4588 [2019-10-14 23:50:49,328 INFO L226 Difference]: Without dead ends: 2495 [2019-10-14 23:50:49,338 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:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-10-14 23:50:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2374. [2019-10-14 23:50:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-10-14 23:50:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3644 transitions. [2019-10-14 23:50:49,570 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3644 transitions. Word has length 47 [2019-10-14 23:50:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:49,570 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 3644 transitions. [2019-10-14 23:50:49,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3644 transitions. [2019-10-14 23:50:49,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:50:49,572 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:49,572 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, 1] [2019-10-14 23:50:49,572 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:49,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1760491084, now seen corresponding path program 1 times [2019-10-14 23:50:49,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:49,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337480018] [2019-10-14 23:50:49,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:49,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:49,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:49,695 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:49,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337480018] [2019-10-14 23:50:49,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:49,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:50:49,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272287166] [2019-10-14 23:50:49,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:49,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:49,697 INFO L87 Difference]: Start difference. First operand 2374 states and 3644 transitions. Second operand 4 states. [2019-10-14 23:50:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:50,698 INFO L93 Difference]: Finished difference Result 5658 states and 8838 transitions. [2019-10-14 23:50:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:50,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-14 23:50:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:50,721 INFO L225 Difference]: With dead ends: 5658 [2019-10-14 23:50:50,722 INFO L226 Difference]: Without dead ends: 3326 [2019-10-14 23:50:50,732 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:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2019-10-14 23:50:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3083. [2019-10-14 23:50:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3083 states. [2019-10-14 23:50:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 4746 transitions. [2019-10-14 23:50:51,034 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 4746 transitions. Word has length 47 [2019-10-14 23:50:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:51,034 INFO L462 AbstractCegarLoop]: Abstraction has 3083 states and 4746 transitions. [2019-10-14 23:50:51,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 4746 transitions. [2019-10-14 23:50:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-14 23:50:51,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:51,040 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:50:51,040 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1060036737, now seen corresponding path program 1 times [2019-10-14 23:50:51,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:51,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940756563] [2019-10-14 23:50:51,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:51,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:50:51,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940756563] [2019-10-14 23:50:51,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:51,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:50:51,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541657693] [2019-10-14 23:50:51,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:50:51,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:50:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:51,207 INFO L87 Difference]: Start difference. First operand 3083 states and 4746 transitions. Second operand 7 states. [2019-10-14 23:50:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:53,646 INFO L93 Difference]: Finished difference Result 10092 states and 16465 transitions. [2019-10-14 23:50:53,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:50:53,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-10-14 23:50:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:53,691 INFO L225 Difference]: With dead ends: 10092 [2019-10-14 23:50:53,691 INFO L226 Difference]: Without dead ends: 7045 [2019-10-14 23:50:53,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:50:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7045 states. [2019-10-14 23:50:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7045 to 5734. [2019-10-14 23:50:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5734 states. [2019-10-14 23:50:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5734 states to 5734 states and 9114 transitions. [2019-10-14 23:50:54,284 INFO L78 Accepts]: Start accepts. Automaton has 5734 states and 9114 transitions. Word has length 67 [2019-10-14 23:50:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:54,285 INFO L462 AbstractCegarLoop]: Abstraction has 5734 states and 9114 transitions. [2019-10-14 23:50:54,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:50:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 5734 states and 9114 transitions. [2019-10-14 23:50:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-14 23:50:54,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:54,292 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, 1] [2019-10-14 23:50:54,292 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1168897503, now seen corresponding path program 1 times [2019-10-14 23:50:54,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:54,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778686793] [2019-10-14 23:50:54,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:54,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:54,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,434 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:54,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778686793] [2019-10-14 23:50:54,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082600029] [2019-10-14 23:50:54,435 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:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:54,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:54,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:54,617 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:54,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:54,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2019-10-14 23:50:54,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121627368] [2019-10-14 23:50:54,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:54,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:50:54,620 INFO L87 Difference]: Start difference. First operand 5734 states and 9114 transitions. Second operand 3 states. [2019-10-14 23:50:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:55,706 INFO L93 Difference]: Finished difference Result 12876 states and 20843 transitions. [2019-10-14 23:50:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:55,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-14 23:50:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:55,731 INFO L225 Difference]: With dead ends: 12876 [2019-10-14 23:50:55,732 INFO L226 Difference]: Without dead ends: 4255 [2019-10-14 23:50:55,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 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:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-10-14 23:50:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4229. [2019-10-14 23:50:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4229 states. [2019-10-14 23:50:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 6538 transitions. [2019-10-14 23:50:56,239 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 6538 transitions. Word has length 81 [2019-10-14 23:50:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:56,239 INFO L462 AbstractCegarLoop]: Abstraction has 4229 states and 6538 transitions. [2019-10-14 23:50:56,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 6538 transitions. [2019-10-14 23:50:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:50:56,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:56,255 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] [2019-10-14 23:50:56,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:56,469 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:56,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1422823091, now seen corresponding path program 1 times [2019-10-14 23:50:56,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:56,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790866337] [2019-10-14 23:50:56,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:56,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,804 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:56,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790866337] [2019-10-14 23:50:56,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897055311] [2019-10-14 23:50:56,805 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:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:56,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:56,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-14 23:50:57,038 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:57,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-10-14 23:50:57,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199038424] [2019-10-14 23:50:57,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:57,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:57,042 INFO L87 Difference]: Start difference. First operand 4229 states and 6538 transitions. Second operand 3 states. [2019-10-14 23:50:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:57,531 INFO L93 Difference]: Finished difference Result 4234 states and 6544 transitions. [2019-10-14 23:50:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:57,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-14 23:50:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:57,558 INFO L225 Difference]: With dead ends: 4234 [2019-10-14 23:50:57,558 INFO L226 Difference]: Without dead ends: 4231 [2019-10-14 23:50:57,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:50:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-10-14 23:50:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4231. [2019-10-14 23:50:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4231 states. [2019-10-14 23:50:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4231 states to 4231 states and 6540 transitions. [2019-10-14 23:50:57,965 INFO L78 Accepts]: Start accepts. Automaton has 4231 states and 6540 transitions. Word has length 122 [2019-10-14 23:50:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:57,966 INFO L462 AbstractCegarLoop]: Abstraction has 4231 states and 6540 transitions. [2019-10-14 23:50:57,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4231 states and 6540 transitions. [2019-10-14 23:50:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:50:57,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:57,980 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] [2019-10-14 23:50:58,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:58,194 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:58,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1422770298, now seen corresponding path program 1 times [2019-10-14 23:50:58,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:58,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884775087] [2019-10-14 23:50:58,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:58,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:58,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,461 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:58,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884775087] [2019-10-14 23:50:58,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733650270] [2019-10-14 23:50:58,462 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:50:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:58,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:50:58,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:58,696 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:58,697 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:58,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-14 23:50:58,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241728882] [2019-10-14 23:50:58,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:50:58,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:58,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:50:58,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:50:58,699 INFO L87 Difference]: Start difference. First operand 4231 states and 6540 transitions. Second operand 9 states. [2019-10-14 23:51:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:01,422 INFO L93 Difference]: Finished difference Result 10484 states and 16653 transitions. [2019-10-14 23:51:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:51:01,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2019-10-14 23:51:01,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:01,455 INFO L225 Difference]: With dead ends: 10484 [2019-10-14 23:51:01,455 INFO L226 Difference]: Without dead ends: 6301 [2019-10-14 23:51:01,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:51:01,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2019-10-14 23:51:01,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 5042. [2019-10-14 23:51:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2019-10-14 23:51:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 7538 transitions. [2019-10-14 23:51:02,001 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 7538 transitions. Word has length 122 [2019-10-14 23:51:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:02,002 INFO L462 AbstractCegarLoop]: Abstraction has 5042 states and 7538 transitions. [2019-10-14 23:51:02,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:51:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 7538 transitions. [2019-10-14 23:51:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-14 23:51:02,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:02,022 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, 1] [2019-10-14 23:51:02,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:02,233 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1128041771, now seen corresponding path program 1 times [2019-10-14 23:51:02,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:51:02,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875390554] [2019-10-14 23:51:02,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:02,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:02,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-14 23:51:02,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875390554] [2019-10-14 23:51:02,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:02,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:51:02,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626792820] [2019-10-14 23:51:02,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:51:02,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:51:02,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:51:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:51:02,548 INFO L87 Difference]: Start difference. First operand 5042 states and 7538 transitions. Second operand 7 states. [2019-10-14 23:51:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:04,595 INFO L93 Difference]: Finished difference Result 14409 states and 21933 transitions. [2019-10-14 23:51:04,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:51:04,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-10-14 23:51:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:04,628 INFO L225 Difference]: With dead ends: 14409 [2019-10-14 23:51:04,628 INFO L226 Difference]: Without dead ends: 9376 [2019-10-14 23:51:04,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:51:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states.