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/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:08:35,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:08:35,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:08:35,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:08:35,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:08:35,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:08:35,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:08:35,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:08:35,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:08:35,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:08:35,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:08:35,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:08:35,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:08:35,263 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:08:35,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:08:35,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:08:35,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:08:35,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:08:35,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:08:35,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:08:35,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:08:35,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:08:35,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:08:35,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:08:35,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:08:35,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:08:35,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:08:35,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:08:35,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:08:35,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:08:35,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:08:35,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:08:35,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:08:35,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:08:35,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:08:35,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:08:35,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:08:35,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:08:35,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:08:35,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:08:35,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:08:35,315 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-09-20 13:08:35,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:08:35,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:08:35,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:08:35,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:08:35,341 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:08:35,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:08:35,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:08:35,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:08:35,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:08:35,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:08:35,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:08:35,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:08:35,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:08:35,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:08:35,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:08:35,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:08:35,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:08:35,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:08:35,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:08:35,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:08:35,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:08:35,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:35,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:08:35,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:08:35,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:08:35,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:08:35,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:08:35,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:08:35,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:08:35,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:08:35,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:08:35,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:08:35,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:08:35,433 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:08:35,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-09-20 13:08:35,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd4a332a/1bfb8b3fdf4942caab972d62009aeb3f/FLAGaf1c20476 [2019-09-20 13:08:36,040 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:08:36,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.01.cil-1.c [2019-09-20 13:08:36,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd4a332a/1bfb8b3fdf4942caab972d62009aeb3f/FLAGaf1c20476 [2019-09-20 13:08:36,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd4a332a/1bfb8b3fdf4942caab972d62009aeb3f [2019-09-20 13:08:36,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:08:36,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:08:36,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:36,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:08:36,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:08:36,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702bca65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36, skipping insertion in model container [2019-09-20 13:08:36,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:08:36,416 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:08:36,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:36,649 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:08:36,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:36,834 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:08:36,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36 WrapperNode [2019-09-20 13:08:36,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:36,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:08:36,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:08:36,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:08:36,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (1/1) ... [2019-09-20 13:08:36,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:08:36,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:08:36,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:08:36,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:08:36,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (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-09-20 13:08:36,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:08:36,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:08:36,936 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:08:36,936 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-20 13:08:36,936 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-20 13:08:36,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-20 13:08:36,936 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-20 13:08:36,937 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:08:36,937 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:08:36,937 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:08:36,937 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:08:36,937 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:08:36,937 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:08:36,938 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:08:36,938 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-20 13:08:36,938 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-20 13:08:36,938 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-20 13:08:36,938 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:08:36,938 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:08:36,939 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:08:36,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:08:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:08:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:08:36,939 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-20 13:08:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-20 13:08:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-20 13:08:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:08:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-20 13:08:36,940 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-20 13:08:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:08:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:08:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:08:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:08:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:08:36,941 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:08:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:08:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-20 13:08:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-20 13:08:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:08:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:08:36,942 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:08:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:08:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:08:36,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:08:37,483 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:08:37,484 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:08:37,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:37 BoogieIcfgContainer [2019-09-20 13:08:37,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:08:37,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:08:37,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:08:37,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:08:37,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:36" (1/3) ... [2019-09-20 13:08:37,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf7dfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:37, skipping insertion in model container [2019-09-20 13:08:37,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:36" (2/3) ... [2019-09-20 13:08:37,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf7dfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:37, skipping insertion in model container [2019-09-20 13:08:37,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:37" (3/3) ... [2019-09-20 13:08:37,494 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2019-09-20 13:08:37,505 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:08:37,513 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:08:37,530 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:08:37,563 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:08:37,564 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:08:37,564 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:08:37,564 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:08:37,565 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:08:37,565 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:08:37,565 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:08:37,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:08:37,566 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:08:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-20 13:08:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:37,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:37,599 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:37,601 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 205618956, now seen corresponding path program 1 times [2019-09-20 13:08:37,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:37,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:37,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:37,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:37,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:37,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:37,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:37,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:37,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:37,989 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-20 13:08:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:38,663 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2019-09-20 13:08:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:38,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:38,681 INFO L225 Difference]: With dead ends: 298 [2019-09-20 13:08:38,681 INFO L226 Difference]: Without dead ends: 161 [2019-09-20 13:08:38,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-20 13:08:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-09-20 13:08:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-20 13:08:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2019-09-20 13:08:38,793 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2019-09-20 13:08:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:38,794 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2019-09-20 13:08:38,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2019-09-20 13:08:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:38,798 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:38,799 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:38,799 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 246293706, now seen corresponding path program 1 times [2019-09-20 13:08:38,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:38,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:38,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:38,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:38,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:38,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:38,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:38,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:38,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:38,912 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2019-09-20 13:08:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:39,375 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2019-09-20 13:08:39,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:39,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:39,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:39,378 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:08:39,379 INFO L226 Difference]: Without dead ends: 161 [2019-09-20 13:08:39,384 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-20 13:08:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2019-09-20 13:08:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-20 13:08:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2019-09-20 13:08:39,420 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2019-09-20 13:08:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:39,421 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2019-09-20 13:08:39,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2019-09-20 13:08:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:39,427 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:39,428 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:39,429 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:39,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1633079116, now seen corresponding path program 1 times [2019-09-20 13:08:39,429 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:39,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:39,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:39,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:39,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:39,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:39,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:39,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:39,595 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2019-09-20 13:08:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:39,955 INFO L93 Difference]: Finished difference Result 285 states and 387 transitions. [2019-09-20 13:08:39,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:39,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:39,958 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:08:39,958 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:08:39,960 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:08:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2019-09-20 13:08:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-20 13:08:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-09-20 13:08:39,980 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2019-09-20 13:08:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:39,981 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-09-20 13:08:39,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-09-20 13:08:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:39,983 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:39,983 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:39,983 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2076979790, now seen corresponding path program 1 times [2019-09-20 13:08:39,984 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:39,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:39,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:39,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:40,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:40,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:40,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:40,065 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 6 states. [2019-09-20 13:08:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:40,118 INFO L93 Difference]: Finished difference Result 260 states and 348 transitions. [2019-09-20 13:08:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:40,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-20 13:08:40,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:40,126 INFO L225 Difference]: With dead ends: 260 [2019-09-20 13:08:40,126 INFO L226 Difference]: Without dead ends: 145 [2019-09-20 13:08:40,128 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-20 13:08:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2019-09-20 13:08:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-20 13:08:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2019-09-20 13:08:40,165 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 77 [2019-09-20 13:08:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:40,166 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2019-09-20 13:08:40,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2019-09-20 13:08:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:40,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:40,172 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:40,172 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 705172492, now seen corresponding path program 1 times [2019-09-20 13:08:40,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:40,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:40,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:40,243 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand 4 states. [2019-09-20 13:08:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:40,437 INFO L93 Difference]: Finished difference Result 373 states and 497 transitions. [2019-09-20 13:08:40,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:40,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-20 13:08:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:40,440 INFO L225 Difference]: With dead ends: 373 [2019-09-20 13:08:40,441 INFO L226 Difference]: Without dead ends: 253 [2019-09-20 13:08:40,442 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-20 13:08:40,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2019-09-20 13:08:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:08:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 316 transitions. [2019-09-20 13:08:40,475 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 316 transitions. Word has length 77 [2019-09-20 13:08:40,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:40,476 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 316 transitions. [2019-09-20 13:08:40,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 316 transitions. [2019-09-20 13:08:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:40,478 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:40,478 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:40,479 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1830432461, now seen corresponding path program 1 times [2019-09-20 13:08:40,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:40,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:40,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:40,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:40,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:40,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:40,562 INFO L87 Difference]: Start difference. First operand 248 states and 316 transitions. Second operand 6 states. [2019-09-20 13:08:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:40,630 INFO L93 Difference]: Finished difference Result 483 states and 633 transitions. [2019-09-20 13:08:40,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:40,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-09-20 13:08:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:40,637 INFO L225 Difference]: With dead ends: 483 [2019-09-20 13:08:40,637 INFO L226 Difference]: Without dead ends: 255 [2019-09-20 13:08:40,639 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-20 13:08:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-09-20 13:08:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-20 13:08:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 320 transitions. [2019-09-20 13:08:40,676 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 320 transitions. Word has length 77 [2019-09-20 13:08:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:40,678 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 320 transitions. [2019-09-20 13:08:40,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 320 transitions. [2019-09-20 13:08:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:40,680 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:40,681 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:40,681 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:40,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:40,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1762934961, now seen corresponding path program 1 times [2019-09-20 13:08:40,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:40,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:40,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:40,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:40,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:40,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:40,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:40,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:40,808 INFO L87 Difference]: Start difference. First operand 253 states and 320 transitions. Second operand 5 states. [2019-09-20 13:08:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:41,163 INFO L93 Difference]: Finished difference Result 587 states and 751 transitions. [2019-09-20 13:08:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:41,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:41,168 INFO L225 Difference]: With dead ends: 587 [2019-09-20 13:08:41,169 INFO L226 Difference]: Without dead ends: 355 [2019-09-20 13:08:41,170 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-20 13:08:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 313. [2019-09-20 13:08:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-20 13:08:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 384 transitions. [2019-09-20 13:08:41,217 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 384 transitions. Word has length 77 [2019-09-20 13:08:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:41,219 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 384 transitions. [2019-09-20 13:08:41,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 384 transitions. [2019-09-20 13:08:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:41,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:41,220 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:41,221 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:41,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash 160293073, now seen corresponding path program 1 times [2019-09-20 13:08:41,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:41,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:41,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:41,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:41,309 INFO L87 Difference]: Start difference. First operand 313 states and 384 transitions. Second operand 5 states. [2019-09-20 13:08:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:41,580 INFO L93 Difference]: Finished difference Result 605 states and 746 transitions. [2019-09-20 13:08:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:41,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:41,584 INFO L225 Difference]: With dead ends: 605 [2019-09-20 13:08:41,584 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:08:41,585 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:08:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-09-20 13:08:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-09-20 13:08:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 380 transitions. [2019-09-20 13:08:41,610 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 380 transitions. Word has length 77 [2019-09-20 13:08:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:41,611 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 380 transitions. [2019-09-20 13:08:41,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 380 transitions. [2019-09-20 13:08:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:41,612 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:41,612 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:41,613 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash 222332687, now seen corresponding path program 1 times [2019-09-20 13:08:41,613 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:41,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:41,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:41,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:41,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:41,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:41,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:41,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:41,694 INFO L87 Difference]: Start difference. First operand 313 states and 380 transitions. Second operand 5 states. [2019-09-20 13:08:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:42,157 INFO L93 Difference]: Finished difference Result 757 states and 983 transitions. [2019-09-20 13:08:42,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:08:42,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:42,162 INFO L225 Difference]: With dead ends: 757 [2019-09-20 13:08:42,162 INFO L226 Difference]: Without dead ends: 464 [2019-09-20 13:08:42,164 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:08:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-09-20 13:08:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2019-09-20 13:08:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-20 13:08:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 463 transitions. [2019-09-20 13:08:42,200 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 463 transitions. Word has length 77 [2019-09-20 13:08:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:42,201 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 463 transitions. [2019-09-20 13:08:42,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 463 transitions. [2019-09-20 13:08:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:42,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:42,202 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:42,203 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 362881297, now seen corresponding path program 1 times [2019-09-20 13:08:42,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:42,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:42,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:42,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:42,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:42,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:42,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:42,284 INFO L87 Difference]: Start difference. First operand 384 states and 463 transitions. Second operand 5 states. [2019-09-20 13:08:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:42,663 INFO L93 Difference]: Finished difference Result 841 states and 1082 transitions. [2019-09-20 13:08:42,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:42,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-20 13:08:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:42,669 INFO L225 Difference]: With dead ends: 841 [2019-09-20 13:08:42,669 INFO L226 Difference]: Without dead ends: 480 [2019-09-20 13:08:42,671 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-20 13:08:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 415. [2019-09-20 13:08:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-20 13:08:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 486 transitions. [2019-09-20 13:08:42,715 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 486 transitions. Word has length 77 [2019-09-20 13:08:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:42,716 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 486 transitions. [2019-09-20 13:08:42,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 486 transitions. [2019-09-20 13:08:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:08:42,719 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:42,719 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:42,719 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash -969302232, now seen corresponding path program 1 times [2019-09-20 13:08:42,720 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:42,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:42,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:42,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:42,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:42,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:42,781 INFO L87 Difference]: Start difference. First operand 415 states and 486 transitions. Second operand 5 states. [2019-09-20 13:08:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,120 INFO L93 Difference]: Finished difference Result 789 states and 934 transitions. [2019-09-20 13:08:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:43,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-20 13:08:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,123 INFO L225 Difference]: With dead ends: 789 [2019-09-20 13:08:43,124 INFO L226 Difference]: Without dead ends: 394 [2019-09-20 13:08:43,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-20 13:08:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 364. [2019-09-20 13:08:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-20 13:08:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 417 transitions. [2019-09-20 13:08:43,153 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 417 transitions. Word has length 78 [2019-09-20 13:08:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:43,153 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 417 transitions. [2019-09-20 13:08:43,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 417 transitions. [2019-09-20 13:08:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-20 13:08:43,155 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:43,155 INFO L407 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, 1, 1, 1, 1, 1, 1, 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-09-20 13:08:43,155 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:43,156 INFO L82 PathProgramCache]: Analyzing trace with hash 228867791, now seen corresponding path program 1 times [2019-09-20 13:08:43,156 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:43,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:08:43,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:43,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:43,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:43,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:43,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:43,200 INFO L87 Difference]: Start difference. First operand 364 states and 417 transitions. Second operand 3 states. [2019-09-20 13:08:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,270 INFO L93 Difference]: Finished difference Result 1024 states and 1227 transitions. [2019-09-20 13:08:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:08:43,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-20 13:08:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,276 INFO L225 Difference]: With dead ends: 1024 [2019-09-20 13:08:43,277 INFO L226 Difference]: Without dead ends: 680 [2019-09-20 13:08:43,278 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-20 13:08:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2019-09-20 13:08:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-09-20 13:08:43,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 787 transitions. [2019-09-20 13:08:43,336 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 787 transitions. Word has length 77 [2019-09-20 13:08:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:43,337 INFO L475 AbstractCegarLoop]: Abstraction has 676 states and 787 transitions. [2019-09-20 13:08:43,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:08:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 787 transitions. [2019-09-20 13:08:43,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:08:43,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:43,342 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-20 13:08:43,342 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:43,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash 772889349, now seen corresponding path program 1 times [2019-09-20 13:08:43,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:43,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:43,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-20 13:08:43,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:43,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:43,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:43,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:43,426 INFO L87 Difference]: Start difference. First operand 676 states and 787 transitions. Second operand 4 states. [2019-09-20 13:08:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:43,648 INFO L93 Difference]: Finished difference Result 1722 states and 2036 transitions. [2019-09-20 13:08:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:43,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:08:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:43,655 INFO L225 Difference]: With dead ends: 1722 [2019-09-20 13:08:43,655 INFO L226 Difference]: Without dead ends: 805 [2019-09-20 13:08:43,660 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-09-20 13:08:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-09-20 13:08:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-20 13:08:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 897 transitions. [2019-09-20 13:08:43,718 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 897 transitions. Word has length 121 [2019-09-20 13:08:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:43,719 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 897 transitions. [2019-09-20 13:08:43,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 897 transitions. [2019-09-20 13:08:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-20 13:08:43,722 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:43,723 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:43,724 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -797989467, now seen corresponding path program 1 times [2019-09-20 13:08:43,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:43,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-20 13:08:43,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:08:43,811 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:08:43,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:43,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 13:08:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:08:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-20 13:08:44,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:08:44,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-20 13:08:44,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:44,043 INFO L87 Difference]: Start difference. First operand 797 states and 897 transitions. Second operand 4 states. [2019-09-20 13:08:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:44,287 INFO L93 Difference]: Finished difference Result 1906 states and 2163 transitions. [2019-09-20 13:08:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:44,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-20 13:08:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:44,293 INFO L225 Difference]: With dead ends: 1906 [2019-09-20 13:08:44,294 INFO L226 Difference]: Without dead ends: 563 [2019-09-20 13:08:44,298 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-09-20 13:08:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-09-20 13:08:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-20 13:08:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 617 transitions. [2019-09-20 13:08:44,342 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 617 transitions. Word has length 176 [2019-09-20 13:08:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:44,344 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 617 transitions. [2019-09-20 13:08:44,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 617 transitions. [2019-09-20 13:08:44,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-20 13:08:44,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:44,348 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:08:44,348 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:44,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:44,349 INFO L82 PathProgramCache]: Analyzing trace with hash -421514357, now seen corresponding path program 1 times [2019-09-20 13:08:44,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:44,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:44,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:44,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-20 13:08:44,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:44,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:44,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:44,510 INFO L87 Difference]: Start difference. First operand 563 states and 617 transitions. Second operand 6 states. [2019-09-20 13:08:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:45,249 INFO L93 Difference]: Finished difference Result 705 states and 782 transitions. [2019-09-20 13:08:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:08:45,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-20 13:08:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:45,251 INFO L225 Difference]: With dead ends: 705 [2019-09-20 13:08:45,251 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:08:45,253 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:08:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:08:45,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:08:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:08:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:08:45,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2019-09-20 13:08:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:45,255 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:08:45,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:08:45,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:08:45,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 13:08:48,441 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-20 13:08:50,412 WARN L191 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 125 DAG size of output: 57 [2019-09-20 13:08:50,958 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-20 13:08:51,547 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:08:52,137 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:08:52,370 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-09-20 13:08:52,934 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:08:53,476 WARN L191 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:08:53,598 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-20 13:08:54,158 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:08:54,932 WARN L191 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-20 13:08:55,103 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-20 13:08:55,646 WARN L191 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:08:57,750 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 127 DAG size of output: 72 [2019-09-20 13:08:58,275 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-09-20 13:08:59,725 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 126 DAG size of output: 65 [2019-09-20 13:08:59,832 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2019-09-20 13:09:00,819 WARN L191 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2019-09-20 13:09:01,846 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-20 13:09:02,426 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:09:03,897 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-20 13:09:04,219 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-20 13:09:05,630 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 134 DAG size of output: 58 [2019-09-20 13:09:05,882 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-20 13:09:07,314 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-20 13:09:07,745 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-20 13:09:08,326 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-09-20 13:09:09,793 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-09-20 13:09:09,919 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-20 13:09:10,043 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-09-20 13:09:10,362 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-09-20 13:09:11,446 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2019-09-20 13:09:11,941 WARN L191 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-20 13:09:12,444 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-20 13:09:12,820 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-09-20 13:09:14,491 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-09-20 13:09:14,878 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50