/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 13:37:03,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 13:37:03,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 13:37:03,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 13:37:03,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 13:37:03,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 13:37:03,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 13:37:03,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 13:37:03,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 13:37:03,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 13:37:03,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 13:37:03,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 13:37:03,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 13:37:03,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 13:37:03,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 13:37:03,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 13:37:03,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 13:37:03,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 13:37:03,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 13:37:03,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 13:37:03,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 13:37:03,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 13:37:03,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 13:37:03,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 13:37:03,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 13:37:03,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 13:37:03,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 13:37:03,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 13:37:03,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 13:37:03,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 13:37:03,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 13:37:03,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 13:37:03,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 13:37:03,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 13:37:03,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 13:37:03,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 13:37:03,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 13:37:03,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 13:37:03,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 13:37:03,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 13:37:03,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 13:37:03,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 13:37:03,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 13:37:03,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 13:37:03,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 13:37:03,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 13:37:03,135 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 13:37:03,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 13:37:03,135 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 13:37:03,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 13:37:03,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 13:37:03,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 13:37:03,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 13:37:03,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 13:37:03,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 13:37:03,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 13:37:03,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 13:37:03,138 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 13:37:03,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 13:37:03,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 13:37:03,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 13:37:03,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 13:37:03,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 13:37:03,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:37:03,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 13:37:03,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 13:37:03,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 13:37:03,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 13:37:03,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 13:37:03,141 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 13:37:03,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 13:37:03,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 13:37:03,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 13:37:03,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 13:37:03,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 13:37:03,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 13:37:03,435 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 13:37:03,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 13:37:03,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86a7ea9/26f30425821b460daa1b62260c5e7d09/FLAGdc005c4f3 [2019-12-27 13:37:04,129 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 13:37:04,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.oepc.i [2019-12-27 13:37:04,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86a7ea9/26f30425821b460daa1b62260c5e7d09/FLAGdc005c4f3 [2019-12-27 13:37:04,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc86a7ea9/26f30425821b460daa1b62260c5e7d09 [2019-12-27 13:37:04,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 13:37:04,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 13:37:04,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 13:37:04,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 13:37:04,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 13:37:04,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:37:04" (1/1) ... [2019-12-27 13:37:04,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:04, skipping insertion in model container [2019-12-27 13:37:04,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:37:04" (1/1) ... [2019-12-27 13:37:04,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 13:37:04,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 13:37:05,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:37:05,058 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 13:37:05,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:37:05,212 INFO L208 MainTranslator]: Completed translation [2019-12-27 13:37:05,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05 WrapperNode [2019-12-27 13:37:05,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 13:37:05,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 13:37:05,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 13:37:05,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 13:37:05,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 13:37:05,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 13:37:05,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 13:37:05,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 13:37:05,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (1/1) ... [2019-12-27 13:37:05,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 13:37:05,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 13:37:05,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 13:37:05,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 13:37:05,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (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-12-27 13:37:05,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 13:37:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 13:37:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 13:37:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 13:37:05,397 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 13:37:05,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 13:37:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 13:37:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 13:37:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 13:37:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 13:37:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 13:37:05,400 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 13:37:06,080 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 13:37:06,081 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 13:37:06,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:37:06 BoogieIcfgContainer [2019-12-27 13:37:06,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 13:37:06,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 13:37:06,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 13:37:06,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 13:37:06,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:37:04" (1/3) ... [2019-12-27 13:37:06,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcef891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:37:06, skipping insertion in model container [2019-12-27 13:37:06,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:37:05" (2/3) ... [2019-12-27 13:37:06,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcef891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:37:06, skipping insertion in model container [2019-12-27 13:37:06,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:37:06" (3/3) ... [2019-12-27 13:37:06,092 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc.i [2019-12-27 13:37:06,103 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 13:37:06,104 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 13:37:06,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 13:37:06,115 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 13:37:06,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,177 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,204 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,205 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:37:06,225 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 13:37:06,250 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 13:37:06,251 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 13:37:06,251 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 13:37:06,251 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 13:37:06,251 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 13:37:06,252 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 13:37:06,252 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 13:37:06,252 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 13:37:06,275 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-27 13:37:07,597 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-27 13:37:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-27 13:37:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 13:37:07,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:07,608 INFO L411 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] [2019-12-27 13:37:07,608 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:07,614 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-27 13:37:07,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:07,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300003500] [2019-12-27 13:37:07,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:07,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300003500] [2019-12-27 13:37:07,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:07,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:07,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100865595] [2019-12-27 13:37:07,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:07,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:07,934 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-27 13:37:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:08,579 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-27 13:37:08,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:37:08,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 13:37:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:08,757 INFO L225 Difference]: With dead ends: 23454 [2019-12-27 13:37:08,757 INFO L226 Difference]: Without dead ends: 21278 [2019-12-27 13:37:08,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-27 13:37:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-27 13:37:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-27 13:37:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-27 13:37:10,759 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-27 13:37:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:10,760 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-27 13:37:10,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-27 13:37:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 13:37:10,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:10,781 INFO L411 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] [2019-12-27 13:37:10,782 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-27 13:37:10,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:10,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322260436] [2019-12-27 13:37:10,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:10,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322260436] [2019-12-27 13:37:10,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:10,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:10,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399506468] [2019-12-27 13:37:10,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:10,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:10,986 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-27 13:37:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:12,140 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-27 13:37:12,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:12,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 13:37:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:12,324 INFO L225 Difference]: With dead ends: 34712 [2019-12-27 13:37:12,324 INFO L226 Difference]: Without dead ends: 34568 [2019-12-27 13:37:12,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-27 13:37:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-27 13:37:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-27 13:37:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 13:37:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-27 13:37:14,595 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-27 13:37:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:14,597 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-27 13:37:14,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-27 13:37:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 13:37:14,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:14,601 INFO L411 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] [2019-12-27 13:37:14,602 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-27 13:37:14,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:14,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397633497] [2019-12-27 13:37:14,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:14,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397633497] [2019-12-27 13:37:14,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:14,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:14,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944826233] [2019-12-27 13:37:14,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:14,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:14,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:14,694 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-27 13:37:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:15,476 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-27 13:37:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:15,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-27 13:37:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:15,664 INFO L225 Difference]: With dead ends: 40220 [2019-12-27 13:37:15,665 INFO L226 Difference]: Without dead ends: 40060 [2019-12-27 13:37:15,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-12-27 13:37:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-27 13:37:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-27 13:37:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-27 13:37:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-27 13:37:18,228 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-27 13:37:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:18,228 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-27 13:37:18,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-27 13:37:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 13:37:18,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:18,243 INFO L411 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] [2019-12-27 13:37:18,243 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:18,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:18,244 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-27 13:37:18,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:18,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325002984] [2019-12-27 13:37:18,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:18,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325002984] [2019-12-27 13:37:18,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:18,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:18,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950867244] [2019-12-27 13:37:18,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:18,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:18,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:18,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:18,380 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-27 13:37:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:19,586 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-27 13:37:19,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:37:19,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 13:37:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:19,737 INFO L225 Difference]: With dead ends: 45669 [2019-12-27 13:37:19,737 INFO L226 Difference]: Without dead ends: 45525 [2019-12-27 13:37:19,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 13:37:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-27 13:37:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-27 13:37:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-27 13:37:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-27 13:37:22,132 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-27 13:37:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:22,132 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-27 13:37:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-27 13:37:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 13:37:22,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:22,167 INFO L411 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] [2019-12-27 13:37:22,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-27 13:37:22,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:22,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775568721] [2019-12-27 13:37:22,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:22,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775568721] [2019-12-27 13:37:22,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:22,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:22,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286668783] [2019-12-27 13:37:22,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:22,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:22,255 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-27 13:37:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:22,996 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-27 13:37:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:37:22,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 13:37:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:23,133 INFO L225 Difference]: With dead ends: 46076 [2019-12-27 13:37:23,133 INFO L226 Difference]: Without dead ends: 45836 [2019-12-27 13:37:23,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:37:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-27 13:37:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-27 13:37:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-27 13:37:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-27 13:37:24,463 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-27 13:37:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:24,464 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-27 13:37:24,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-27 13:37:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 13:37:24,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:24,501 INFO L411 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] [2019-12-27 13:37:24,501 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-27 13:37:24,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:24,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461742823] [2019-12-27 13:37:24,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:24,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461742823] [2019-12-27 13:37:24,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:24,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:37:24,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342616666] [2019-12-27 13:37:24,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:37:24,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:24,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:37:24,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:24,548 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-27 13:37:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:26,166 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-27 13:37:26,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:37:26,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 13:37:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:26,270 INFO L225 Difference]: With dead ends: 50263 [2019-12-27 13:37:26,270 INFO L226 Difference]: Without dead ends: 50263 [2019-12-27 13:37:26,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-27 13:37:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-27 13:37:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-27 13:37:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-27 13:37:27,421 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-27 13:37:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:27,422 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-27 13:37:27,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:37:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-27 13:37:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 13:37:27,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:27,457 INFO L411 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] [2019-12-27 13:37:27,457 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-27 13:37:27,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:27,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837082067] [2019-12-27 13:37:27,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:27,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837082067] [2019-12-27 13:37:27,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:27,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:27,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856647011] [2019-12-27 13:37:27,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:27,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:27,555 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-27 13:37:28,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:28,558 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-27 13:37:28,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:37:28,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 13:37:28,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:28,675 INFO L225 Difference]: With dead ends: 55891 [2019-12-27 13:37:28,675 INFO L226 Difference]: Without dead ends: 55651 [2019-12-27 13:37:28,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:37:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-27 13:37:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-27 13:37:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-27 13:37:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-27 13:37:30,023 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-27 13:37:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:30,023 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-27 13:37:30,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-27 13:37:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:37:30,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:30,059 INFO L411 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] [2019-12-27 13:37:30,059 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:30,059 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-27 13:37:30,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:30,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856603235] [2019-12-27 13:37:30,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:30,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856603235] [2019-12-27 13:37:30,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:30,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:30,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819477891] [2019-12-27 13:37:30,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:30,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:30,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:30,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:30,137 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-27 13:37:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:30,696 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-27 13:37:30,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:30,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 13:37:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:30,862 INFO L225 Difference]: With dead ends: 69403 [2019-12-27 13:37:30,862 INFO L226 Difference]: Without dead ends: 69403 [2019-12-27 13:37:30,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-27 13:37:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-27 13:37:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-27 13:37:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-27 13:37:33,868 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-27 13:37:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:33,868 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-27 13:37:33,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-27 13:37:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:37:33,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:33,907 INFO L411 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] [2019-12-27 13:37:33,907 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:33,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-27 13:37:33,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:33,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826144651] [2019-12-27 13:37:33,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:34,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826144651] [2019-12-27 13:37:34,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:34,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:34,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678843478] [2019-12-27 13:37:34,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:34,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:34,002 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-27 13:37:35,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:35,620 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-27 13:37:35,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:37:35,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 13:37:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:35,754 INFO L225 Difference]: With dead ends: 63822 [2019-12-27 13:37:35,754 INFO L226 Difference]: Without dead ends: 63622 [2019-12-27 13:37:35,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 13:37:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-27 13:37:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-27 13:37:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-27 13:37:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-27 13:37:39,431 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-27 13:37:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:39,431 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-27 13:37:39,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-27 13:37:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:37:39,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:39,488 INFO L411 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] [2019-12-27 13:37:39,488 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:39,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:39,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-27 13:37:39,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:39,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812625715] [2019-12-27 13:37:39,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:39,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812625715] [2019-12-27 13:37:39,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:39,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:37:39,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399113153] [2019-12-27 13:37:39,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:37:39,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:37:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:37:39,587 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-27 13:37:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:40,383 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-27 13:37:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:37:40,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 13:37:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:40,547 INFO L225 Difference]: With dead ends: 75817 [2019-12-27 13:37:40,548 INFO L226 Difference]: Without dead ends: 75173 [2019-12-27 13:37:40,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-27 13:37:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-27 13:37:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-27 13:37:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-27 13:37:42,188 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-27 13:37:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:42,188 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-27 13:37:42,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:37:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-27 13:37:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:37:42,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:42,262 INFO L411 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] [2019-12-27 13:37:42,263 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-27 13:37:42,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:42,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698697645] [2019-12-27 13:37:42,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:42,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698697645] [2019-12-27 13:37:42,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:42,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:37:42,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024045738] [2019-12-27 13:37:42,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:37:42,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:37:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:42,364 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-27 13:37:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:43,463 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-27 13:37:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:37:43,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 13:37:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:43,666 INFO L225 Difference]: With dead ends: 92241 [2019-12-27 13:37:43,666 INFO L226 Difference]: Without dead ends: 92241 [2019-12-27 13:37:43,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:37:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-27 13:37:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-27 13:37:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-27 13:37:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-27 13:37:45,948 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-27 13:37:45,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:45,948 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-27 13:37:45,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:37:45,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-27 13:37:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:37:46,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:46,029 INFO L411 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] [2019-12-27 13:37:46,029 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:46,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-27 13:37:46,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:46,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214095064] [2019-12-27 13:37:46,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:46,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214095064] [2019-12-27 13:37:46,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:46,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:37:46,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288597213] [2019-12-27 13:37:46,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:37:46,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:37:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:46,100 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 3 states. [2019-12-27 13:37:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:47,204 INFO L93 Difference]: Finished difference Result 63509 states and 230498 transitions. [2019-12-27 13:37:47,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:37:47,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 13:37:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:47,341 INFO L225 Difference]: With dead ends: 63509 [2019-12-27 13:37:47,341 INFO L226 Difference]: Without dead ends: 63347 [2019-12-27 13:37:47,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:37:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63347 states. [2019-12-27 13:37:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63347 to 63307. [2019-12-27 13:37:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63307 states. [2019-12-27 13:37:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63307 states to 63307 states and 229913 transitions. [2019-12-27 13:37:48,443 INFO L78 Accepts]: Start accepts. Automaton has 63307 states and 229913 transitions. Word has length 68 [2019-12-27 13:37:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:48,443 INFO L462 AbstractCegarLoop]: Abstraction has 63307 states and 229913 transitions. [2019-12-27 13:37:48,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:37:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 63307 states and 229913 transitions. [2019-12-27 13:37:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 13:37:48,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:48,492 INFO L411 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] [2019-12-27 13:37:48,492 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1567683976, now seen corresponding path program 1 times [2019-12-27 13:37:48,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:48,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585824348] [2019-12-27 13:37:48,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:48,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585824348] [2019-12-27 13:37:48,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:48,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:37:48,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080666157] [2019-12-27 13:37:48,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:37:48,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:37:48,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:48,584 INFO L87 Difference]: Start difference. First operand 63307 states and 229913 transitions. Second operand 5 states. [2019-12-27 13:37:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:49,738 INFO L93 Difference]: Finished difference Result 84435 states and 303683 transitions. [2019-12-27 13:37:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:37:49,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 13:37:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:49,936 INFO L225 Difference]: With dead ends: 84435 [2019-12-27 13:37:49,936 INFO L226 Difference]: Without dead ends: 84239 [2019-12-27 13:37:49,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:37:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84239 states. [2019-12-27 13:37:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84239 to 76154. [2019-12-27 13:37:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76154 states. [2019-12-27 13:37:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76154 states to 76154 states and 275571 transitions. [2019-12-27 13:37:51,390 INFO L78 Accepts]: Start accepts. Automaton has 76154 states and 275571 transitions. Word has length 69 [2019-12-27 13:37:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:51,390 INFO L462 AbstractCegarLoop]: Abstraction has 76154 states and 275571 transitions. [2019-12-27 13:37:51,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:37:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand 76154 states and 275571 transitions. [2019-12-27 13:37:51,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 13:37:51,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:51,451 INFO L411 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] [2019-12-27 13:37:51,451 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:51,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:51,451 INFO L82 PathProgramCache]: Analyzing trace with hash -322919495, now seen corresponding path program 1 times [2019-12-27 13:37:51,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:51,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967005670] [2019-12-27 13:37:51,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:54,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967005670] [2019-12-27 13:37:54,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:54,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:54,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19052088] [2019-12-27 13:37:54,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:54,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:54,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:54,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:54,419 INFO L87 Difference]: Start difference. First operand 76154 states and 275571 transitions. Second operand 4 states. [2019-12-27 13:37:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:54,531 INFO L93 Difference]: Finished difference Result 19622 states and 62292 transitions. [2019-12-27 13:37:54,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:54,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 13:37:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:54,573 INFO L225 Difference]: With dead ends: 19622 [2019-12-27 13:37:54,573 INFO L226 Difference]: Without dead ends: 19144 [2019-12-27 13:37:54,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2019-12-27 13:37:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19132. [2019-12-27 13:37:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2019-12-27 13:37:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 60787 transitions. [2019-12-27 13:37:54,843 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 60787 transitions. Word has length 69 [2019-12-27 13:37:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:54,843 INFO L462 AbstractCegarLoop]: Abstraction has 19132 states and 60787 transitions. [2019-12-27 13:37:54,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 60787 transitions. [2019-12-27 13:37:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:37:54,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:54,859 INFO L411 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-12-27 13:37:54,859 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash 992958347, now seen corresponding path program 1 times [2019-12-27 13:37:54,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:54,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803312354] [2019-12-27 13:37:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:54,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803312354] [2019-12-27 13:37:54,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:37:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717164217] [2019-12-27 13:37:54,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:37:54,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:54,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:37:54,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:37:54,918 INFO L87 Difference]: Start difference. First operand 19132 states and 60787 transitions. Second operand 4 states. [2019-12-27 13:37:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:55,163 INFO L93 Difference]: Finished difference Result 24082 states and 75455 transitions. [2019-12-27 13:37:55,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:37:55,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-27 13:37:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:55,200 INFO L225 Difference]: With dead ends: 24082 [2019-12-27 13:37:55,200 INFO L226 Difference]: Without dead ends: 24082 [2019-12-27 13:37:55,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:37:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24082 states. [2019-12-27 13:37:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24082 to 19972. [2019-12-27 13:37:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2019-12-27 13:37:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 63154 transitions. [2019-12-27 13:37:55,499 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 63154 transitions. Word has length 78 [2019-12-27 13:37:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:55,499 INFO L462 AbstractCegarLoop]: Abstraction has 19972 states and 63154 transitions. [2019-12-27 13:37:55,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:37:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 63154 transitions. [2019-12-27 13:37:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:37:55,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:55,516 INFO L411 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-12-27 13:37:55,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:55,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:55,516 INFO L82 PathProgramCache]: Analyzing trace with hash 738221802, now seen corresponding path program 1 times [2019-12-27 13:37:55,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:55,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082081735] [2019-12-27 13:37:55,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:55,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082081735] [2019-12-27 13:37:55,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:55,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:37:55,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538758474] [2019-12-27 13:37:55,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:37:55,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:55,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:37:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:55,622 INFO L87 Difference]: Start difference. First operand 19972 states and 63154 transitions. Second operand 8 states. [2019-12-27 13:37:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:56,563 INFO L93 Difference]: Finished difference Result 22078 states and 69346 transitions. [2019-12-27 13:37:56,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 13:37:56,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-27 13:37:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:56,597 INFO L225 Difference]: With dead ends: 22078 [2019-12-27 13:37:56,597 INFO L226 Difference]: Without dead ends: 22030 [2019-12-27 13:37:56,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 13:37:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22030 states. [2019-12-27 13:37:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22030 to 19444. [2019-12-27 13:37:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19444 states. [2019-12-27 13:37:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19444 states to 19444 states and 61656 transitions. [2019-12-27 13:37:56,880 INFO L78 Accepts]: Start accepts. Automaton has 19444 states and 61656 transitions. Word has length 78 [2019-12-27 13:37:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:37:56,880 INFO L462 AbstractCegarLoop]: Abstraction has 19444 states and 61656 transitions. [2019-12-27 13:37:56,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:37:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19444 states and 61656 transitions. [2019-12-27 13:37:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:37:56,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:37:56,899 INFO L411 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, 1, 1, 1] [2019-12-27 13:37:56,900 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:37:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:37:56,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1156410968, now seen corresponding path program 1 times [2019-12-27 13:37:56,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:37:56,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335991959] [2019-12-27 13:37:56,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:37:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:37:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:37:56,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335991959] [2019-12-27 13:37:56,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:37:56,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:37:56,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183118378] [2019-12-27 13:37:56,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:37:56,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:37:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:37:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:37:56,997 INFO L87 Difference]: Start difference. First operand 19444 states and 61656 transitions. Second operand 8 states. [2019-12-27 13:37:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:37:59,833 INFO L93 Difference]: Finished difference Result 50438 states and 153674 transitions. [2019-12-27 13:37:59,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 13:37:59,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-27 13:37:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:37:59,912 INFO L225 Difference]: With dead ends: 50438 [2019-12-27 13:37:59,913 INFO L226 Difference]: Without dead ends: 49739 [2019-12-27 13:37:59,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 13:37:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49739 states. [2019-12-27 13:38:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49739 to 29972. [2019-12-27 13:38:00,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29972 states. [2019-12-27 13:38:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29972 states to 29972 states and 93586 transitions. [2019-12-27 13:38:00,450 INFO L78 Accepts]: Start accepts. Automaton has 29972 states and 93586 transitions. Word has length 81 [2019-12-27 13:38:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:00,450 INFO L462 AbstractCegarLoop]: Abstraction has 29972 states and 93586 transitions. [2019-12-27 13:38:00,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:38:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29972 states and 93586 transitions. [2019-12-27 13:38:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:38:00,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:00,478 INFO L411 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, 1, 1, 1] [2019-12-27 13:38:00,479 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash -194796951, now seen corresponding path program 1 times [2019-12-27 13:38:00,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:00,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853800283] [2019-12-27 13:38:00,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:00,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853800283] [2019-12-27 13:38:00,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:00,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:00,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121166561] [2019-12-27 13:38:00,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:00,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:00,573 INFO L87 Difference]: Start difference. First operand 29972 states and 93586 transitions. Second operand 6 states. [2019-12-27 13:38:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:01,145 INFO L93 Difference]: Finished difference Result 31402 states and 97511 transitions. [2019-12-27 13:38:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:01,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:38:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:01,232 INFO L225 Difference]: With dead ends: 31402 [2019-12-27 13:38:01,233 INFO L226 Difference]: Without dead ends: 31402 [2019-12-27 13:38:01,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31402 states. [2019-12-27 13:38:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31402 to 29633. [2019-12-27 13:38:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29633 states. [2019-12-27 13:38:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29633 states to 29633 states and 92417 transitions. [2019-12-27 13:38:02,053 INFO L78 Accepts]: Start accepts. Automaton has 29633 states and 92417 transitions. Word has length 81 [2019-12-27 13:38:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:02,053 INFO L462 AbstractCegarLoop]: Abstraction has 29633 states and 92417 transitions. [2019-12-27 13:38:02,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 29633 states and 92417 transitions. [2019-12-27 13:38:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:38:02,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:02,107 INFO L411 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, 1, 1, 1] [2019-12-27 13:38:02,107 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:02,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2130457238, now seen corresponding path program 1 times [2019-12-27 13:38:02,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:02,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019259440] [2019-12-27 13:38:02,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:02,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019259440] [2019-12-27 13:38:02,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:02,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122430545] [2019-12-27 13:38:02,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:02,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:02,316 INFO L87 Difference]: Start difference. First operand 29633 states and 92417 transitions. Second operand 7 states. [2019-12-27 13:38:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:02,955 INFO L93 Difference]: Finished difference Result 31147 states and 96573 transitions. [2019-12-27 13:38:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:38:02,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-27 13:38:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:03,001 INFO L225 Difference]: With dead ends: 31147 [2019-12-27 13:38:03,002 INFO L226 Difference]: Without dead ends: 31147 [2019-12-27 13:38:03,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:38:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31147 states. [2019-12-27 13:38:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31147 to 29965. [2019-12-27 13:38:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-12-27 13:38:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93248 transitions. [2019-12-27 13:38:03,649 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93248 transitions. Word has length 81 [2019-12-27 13:38:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:03,649 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93248 transitions. [2019-12-27 13:38:03,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93248 transitions. [2019-12-27 13:38:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:38:03,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:03,679 INFO L411 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, 1, 1, 1] [2019-12-27 13:38:03,679 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691477, now seen corresponding path program 1 times [2019-12-27 13:38:03,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:03,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472862798] [2019-12-27 13:38:03,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:03,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472862798] [2019-12-27 13:38:03,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:03,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:03,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293755430] [2019-12-27 13:38:03,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:03,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:03,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:03,752 INFO L87 Difference]: Start difference. First operand 29965 states and 93248 transitions. Second operand 5 states. [2019-12-27 13:38:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:03,792 INFO L93 Difference]: Finished difference Result 4528 states and 11184 transitions. [2019-12-27 13:38:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:38:03,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-27 13:38:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:03,796 INFO L225 Difference]: With dead ends: 4528 [2019-12-27 13:38:03,796 INFO L226 Difference]: Without dead ends: 3738 [2019-12-27 13:38:03,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-12-27 13:38:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3435. [2019-12-27 13:38:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-12-27 13:38:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 8385 transitions. [2019-12-27 13:38:03,832 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 8385 transitions. Word has length 81 [2019-12-27 13:38:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:03,832 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 8385 transitions. [2019-12-27 13:38:03,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 8385 transitions. [2019-12-27 13:38:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:03,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:03,835 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:03,835 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash 636830190, now seen corresponding path program 1 times [2019-12-27 13:38:03,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:03,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246212029] [2019-12-27 13:38:03,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:03,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246212029] [2019-12-27 13:38:03,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:03,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215762105] [2019-12-27 13:38:03,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:03,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:03,959 INFO L87 Difference]: Start difference. First operand 3435 states and 8385 transitions. Second operand 6 states. [2019-12-27 13:38:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:04,307 INFO L93 Difference]: Finished difference Result 3465 states and 8375 transitions. [2019-12-27 13:38:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:38:04,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:38:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:04,312 INFO L225 Difference]: With dead ends: 3465 [2019-12-27 13:38:04,312 INFO L226 Difference]: Without dead ends: 3465 [2019-12-27 13:38:04,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:38:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-27 13:38:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3315. [2019-12-27 13:38:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3315 states. [2019-12-27 13:38:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 8065 transitions. [2019-12-27 13:38:04,346 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 8065 transitions. Word has length 93 [2019-12-27 13:38:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:04,346 INFO L462 AbstractCegarLoop]: Abstraction has 3315 states and 8065 transitions. [2019-12-27 13:38:04,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 8065 transitions. [2019-12-27 13:38:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:04,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:04,350 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:04,351 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 966595951, now seen corresponding path program 1 times [2019-12-27 13:38:04,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:04,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82607245] [2019-12-27 13:38:04,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:04,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82607245] [2019-12-27 13:38:04,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:04,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:04,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432025940] [2019-12-27 13:38:04,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:04,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:04,437 INFO L87 Difference]: Start difference. First operand 3315 states and 8065 transitions. Second operand 4 states. [2019-12-27 13:38:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:04,605 INFO L93 Difference]: Finished difference Result 4130 states and 9838 transitions. [2019-12-27 13:38:04,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:38:04,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-27 13:38:04,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:04,611 INFO L225 Difference]: With dead ends: 4130 [2019-12-27 13:38:04,612 INFO L226 Difference]: Without dead ends: 4073 [2019-12-27 13:38:04,612 INFO L631 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-12-27 13:38:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-12-27 13:38:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3580. [2019-12-27 13:38:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-12-27 13:38:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 8651 transitions. [2019-12-27 13:38:04,649 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 8651 transitions. Word has length 93 [2019-12-27 13:38:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:04,649 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 8651 transitions. [2019-12-27 13:38:04,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 8651 transitions. [2019-12-27 13:38:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:04,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:04,652 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:04,652 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1662428928, now seen corresponding path program 1 times [2019-12-27 13:38:04,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:04,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111185873] [2019-12-27 13:38:04,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:04,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111185873] [2019-12-27 13:38:04,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:04,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:04,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061300674] [2019-12-27 13:38:04,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:04,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:04,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:04,744 INFO L87 Difference]: Start difference. First operand 3580 states and 8651 transitions. Second operand 5 states. [2019-12-27 13:38:05,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:05,244 INFO L93 Difference]: Finished difference Result 5452 states and 13125 transitions. [2019-12-27 13:38:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:05,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:38:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:05,251 INFO L225 Difference]: With dead ends: 5452 [2019-12-27 13:38:05,251 INFO L226 Difference]: Without dead ends: 5452 [2019-12-27 13:38:05,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-27 13:38:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 3913. [2019-12-27 13:38:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2019-12-27 13:38:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 9527 transitions. [2019-12-27 13:38:05,297 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 9527 transitions. Word has length 93 [2019-12-27 13:38:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:05,297 INFO L462 AbstractCegarLoop]: Abstraction has 3913 states and 9527 transitions. [2019-12-27 13:38:05,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:05,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 9527 transitions. [2019-12-27 13:38:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:05,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:05,301 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:05,301 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:05,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1945579392, now seen corresponding path program 1 times [2019-12-27 13:38:05,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:05,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816172324] [2019-12-27 13:38:05,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:05,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:05,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816172324] [2019-12-27 13:38:05,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:05,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:05,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662314880] [2019-12-27 13:38:05,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:05,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:05,407 INFO L87 Difference]: Start difference. First operand 3913 states and 9527 transitions. Second operand 6 states. [2019-12-27 13:38:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:05,726 INFO L93 Difference]: Finished difference Result 4703 states and 11075 transitions. [2019-12-27 13:38:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:38:05,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:38:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:05,735 INFO L225 Difference]: With dead ends: 4703 [2019-12-27 13:38:05,735 INFO L226 Difference]: Without dead ends: 4703 [2019-12-27 13:38:05,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:38:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2019-12-27 13:38:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4080. [2019-12-27 13:38:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-12-27 13:38:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 9838 transitions. [2019-12-27 13:38:05,822 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 9838 transitions. Word has length 93 [2019-12-27 13:38:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:05,823 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 9838 transitions. [2019-12-27 13:38:05,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 9838 transitions. [2019-12-27 13:38:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:05,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:05,830 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:05,831 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:05,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:05,831 INFO L82 PathProgramCache]: Analyzing trace with hash 648647425, now seen corresponding path program 1 times [2019-12-27 13:38:05,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:05,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379746209] [2019-12-27 13:38:05,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:05,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379746209] [2019-12-27 13:38:05,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:05,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:05,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43346866] [2019-12-27 13:38:05,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:05,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:05,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:05,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:05,928 INFO L87 Difference]: Start difference. First operand 4080 states and 9838 transitions. Second operand 5 states. [2019-12-27 13:38:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:06,146 INFO L93 Difference]: Finished difference Result 4870 states and 11542 transitions. [2019-12-27 13:38:06,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:06,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:38:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:06,153 INFO L225 Difference]: With dead ends: 4870 [2019-12-27 13:38:06,153 INFO L226 Difference]: Without dead ends: 4824 [2019-12-27 13:38:06,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-12-27 13:38:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4158. [2019-12-27 13:38:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4158 states. [2019-12-27 13:38:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 10005 transitions. [2019-12-27 13:38:06,200 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 10005 transitions. Word has length 93 [2019-12-27 13:38:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:06,200 INFO L462 AbstractCegarLoop]: Abstraction has 4158 states and 10005 transitions. [2019-12-27 13:38:06,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 10005 transitions. [2019-12-27 13:38:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:06,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:06,204 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:06,204 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash 970728323, now seen corresponding path program 1 times [2019-12-27 13:38:06,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:06,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561940117] [2019-12-27 13:38:06,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:06,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561940117] [2019-12-27 13:38:06,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:06,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:06,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511324484] [2019-12-27 13:38:06,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:06,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:06,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:06,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:06,304 INFO L87 Difference]: Start difference. First operand 4158 states and 10005 transitions. Second operand 7 states. [2019-12-27 13:38:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:06,773 INFO L93 Difference]: Finished difference Result 5046 states and 11917 transitions. [2019-12-27 13:38:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:38:06,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-27 13:38:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:06,780 INFO L225 Difference]: With dead ends: 5046 [2019-12-27 13:38:06,781 INFO L226 Difference]: Without dead ends: 5002 [2019-12-27 13:38:06,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:38:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2019-12-27 13:38:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4203. [2019-12-27 13:38:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4203 states. [2019-12-27 13:38:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 10074 transitions. [2019-12-27 13:38:06,826 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 10074 transitions. Word has length 93 [2019-12-27 13:38:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:06,826 INFO L462 AbstractCegarLoop]: Abstraction has 4203 states and 10074 transitions. [2019-12-27 13:38:06,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 10074 transitions. [2019-12-27 13:38:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:38:06,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:06,830 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:06,830 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:06,831 INFO L82 PathProgramCache]: Analyzing trace with hash 83557860, now seen corresponding path program 1 times [2019-12-27 13:38:06,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:06,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444654593] [2019-12-27 13:38:06,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:06,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-12-27 13:38:06,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444654593] [2019-12-27 13:38:06,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:06,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:06,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621862189] [2019-12-27 13:38:06,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:06,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:06,910 INFO L87 Difference]: Start difference. First operand 4203 states and 10074 transitions. Second operand 6 states. [2019-12-27 13:38:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:07,012 INFO L93 Difference]: Finished difference Result 3248 states and 7928 transitions. [2019-12-27 13:38:07,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:07,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:38:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:07,018 INFO L225 Difference]: With dead ends: 3248 [2019-12-27 13:38:07,018 INFO L226 Difference]: Without dead ends: 3248 [2019-12-27 13:38:07,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-12-27 13:38:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2988. [2019-12-27 13:38:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-27 13:38:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7372 transitions. [2019-12-27 13:38:07,077 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7372 transitions. Word has length 93 [2019-12-27 13:38:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:07,077 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 7372 transitions. [2019-12-27 13:38:07,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7372 transitions. [2019-12-27 13:38:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:07,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:07,083 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:07,084 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948161, now seen corresponding path program 1 times [2019-12-27 13:38:07,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:07,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383844316] [2019-12-27 13:38:07,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:07,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383844316] [2019-12-27 13:38:07,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:07,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:07,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537372849] [2019-12-27 13:38:07,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:07,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:07,245 INFO L87 Difference]: Start difference. First operand 2988 states and 7372 transitions. Second operand 6 states. [2019-12-27 13:38:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:07,353 INFO L93 Difference]: Finished difference Result 3169 states and 7662 transitions. [2019-12-27 13:38:07,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:07,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:38:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:07,359 INFO L225 Difference]: With dead ends: 3169 [2019-12-27 13:38:07,359 INFO L226 Difference]: Without dead ends: 3124 [2019-12-27 13:38:07,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2019-12-27 13:38:07,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3050. [2019-12-27 13:38:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2019-12-27 13:38:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 7431 transitions. [2019-12-27 13:38:07,409 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 7431 transitions. Word has length 95 [2019-12-27 13:38:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:07,409 INFO L462 AbstractCegarLoop]: Abstraction has 3050 states and 7431 transitions. [2019-12-27 13:38:07,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 7431 transitions. [2019-12-27 13:38:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:07,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:07,413 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:07,414 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:07,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1737866465, now seen corresponding path program 2 times [2019-12-27 13:38:07,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:07,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980574981] [2019-12-27 13:38:07,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:07,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980574981] [2019-12-27 13:38:07,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:07,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:07,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11722516] [2019-12-27 13:38:07,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:07,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:07,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:07,520 INFO L87 Difference]: Start difference. First operand 3050 states and 7431 transitions. Second operand 6 states. [2019-12-27 13:38:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:07,718 INFO L93 Difference]: Finished difference Result 3282 states and 7887 transitions. [2019-12-27 13:38:07,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 13:38:07,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:38:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:07,723 INFO L225 Difference]: With dead ends: 3282 [2019-12-27 13:38:07,723 INFO L226 Difference]: Without dead ends: 3282 [2019-12-27 13:38:07,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:38:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-12-27 13:38:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3176. [2019-12-27 13:38:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-12-27 13:38:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 7680 transitions. [2019-12-27 13:38:07,756 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 7680 transitions. Word has length 95 [2019-12-27 13:38:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:07,757 INFO L462 AbstractCegarLoop]: Abstraction has 3176 states and 7680 transitions. [2019-12-27 13:38:07,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 7680 transitions. [2019-12-27 13:38:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:07,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:07,760 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:07,760 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1408100704, now seen corresponding path program 1 times [2019-12-27 13:38:07,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:07,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447957467] [2019-12-27 13:38:07,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:07,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447957467] [2019-12-27 13:38:07,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:07,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:07,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278330912] [2019-12-27 13:38:07,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:07,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:07,818 INFO L87 Difference]: Start difference. First operand 3176 states and 7680 transitions. Second operand 5 states. [2019-12-27 13:38:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:07,951 INFO L93 Difference]: Finished difference Result 3783 states and 8972 transitions. [2019-12-27 13:38:07,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:07,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:38:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:07,956 INFO L225 Difference]: With dead ends: 3783 [2019-12-27 13:38:07,956 INFO L226 Difference]: Without dead ends: 3783 [2019-12-27 13:38:07,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-12-27 13:38:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3514. [2019-12-27 13:38:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-27 13:38:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 8390 transitions. [2019-12-27 13:38:07,992 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 8390 transitions. Word has length 95 [2019-12-27 13:38:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:07,992 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 8390 transitions. [2019-12-27 13:38:07,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 8390 transitions. [2019-12-27 13:38:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:07,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:07,996 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:07,996 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:07,996 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-27 13:38:07,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:07,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559883154] [2019-12-27 13:38:07,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:08,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559883154] [2019-12-27 13:38:08,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:08,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:08,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27620113] [2019-12-27 13:38:08,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:08,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:08,099 INFO L87 Difference]: Start difference. First operand 3514 states and 8390 transitions. Second operand 5 states. [2019-12-27 13:38:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:08,300 INFO L93 Difference]: Finished difference Result 3181 states and 7442 transitions. [2019-12-27 13:38:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:08,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:38:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:08,304 INFO L225 Difference]: With dead ends: 3181 [2019-12-27 13:38:08,304 INFO L226 Difference]: Without dead ends: 3163 [2019-12-27 13:38:08,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-12-27 13:38:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2489. [2019-12-27 13:38:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-12-27 13:38:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5939 transitions. [2019-12-27 13:38:08,332 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5939 transitions. Word has length 95 [2019-12-27 13:38:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:08,332 INFO L462 AbstractCegarLoop]: Abstraction has 2489 states and 5939 transitions. [2019-12-27 13:38:08,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5939 transitions. [2019-12-27 13:38:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:08,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:08,334 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:08,335 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:08,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-27 13:38:08,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:08,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107201573] [2019-12-27 13:38:08,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:08,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107201573] [2019-12-27 13:38:08,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:08,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:08,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480139023] [2019-12-27 13:38:08,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:08,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:08,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:08,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:08,442 INFO L87 Difference]: Start difference. First operand 2489 states and 5939 transitions. Second operand 6 states. [2019-12-27 13:38:08,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:08,557 INFO L93 Difference]: Finished difference Result 2568 states and 6098 transitions. [2019-12-27 13:38:08,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:08,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:38:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:08,561 INFO L225 Difference]: With dead ends: 2568 [2019-12-27 13:38:08,561 INFO L226 Difference]: Without dead ends: 2568 [2019-12-27 13:38:08,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-12-27 13:38:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2463. [2019-12-27 13:38:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-27 13:38:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5887 transitions. [2019-12-27 13:38:08,601 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5887 transitions. Word has length 95 [2019-12-27 13:38:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:08,602 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5887 transitions. [2019-12-27 13:38:08,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5887 transitions. [2019-12-27 13:38:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:08,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:08,606 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:08,606 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:08,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2136197344, now seen corresponding path program 1 times [2019-12-27 13:38:08,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:08,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952441976] [2019-12-27 13:38:08,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:08,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952441976] [2019-12-27 13:38:08,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:08,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:08,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756873360] [2019-12-27 13:38:08,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:08,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:08,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:08,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:08,730 INFO L87 Difference]: Start difference. First operand 2463 states and 5887 transitions. Second operand 5 states. [2019-12-27 13:38:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:08,775 INFO L93 Difference]: Finished difference Result 3753 states and 9136 transitions. [2019-12-27 13:38:08,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:38:08,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:38:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:08,781 INFO L225 Difference]: With dead ends: 3753 [2019-12-27 13:38:08,781 INFO L226 Difference]: Without dead ends: 3753 [2019-12-27 13:38:08,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2019-12-27 13:38:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 2353. [2019-12-27 13:38:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-12-27 13:38:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 5613 transitions. [2019-12-27 13:38:08,825 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 5613 transitions. Word has length 95 [2019-12-27 13:38:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:08,825 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 5613 transitions. [2019-12-27 13:38:08,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 5613 transitions. [2019-12-27 13:38:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:08,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:08,829 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:08,829 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:08,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-27 13:38:08,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:08,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047623891] [2019-12-27 13:38:08,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:08,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047623891] [2019-12-27 13:38:08,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:08,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:08,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847581414] [2019-12-27 13:38:08,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:08,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:08,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:08,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:08,960 INFO L87 Difference]: Start difference. First operand 2353 states and 5613 transitions. Second operand 7 states. [2019-12-27 13:38:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:09,058 INFO L93 Difference]: Finished difference Result 3953 states and 9579 transitions. [2019-12-27 13:38:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:38:09,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 13:38:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:09,060 INFO L225 Difference]: With dead ends: 3953 [2019-12-27 13:38:09,061 INFO L226 Difference]: Without dead ends: 1788 [2019-12-27 13:38:09,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:38:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2019-12-27 13:38:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2019-12-27 13:38:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2019-12-27 13:38:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4325 transitions. [2019-12-27 13:38:09,083 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 4325 transitions. Word has length 95 [2019-12-27 13:38:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:09,083 INFO L462 AbstractCegarLoop]: Abstraction has 1788 states and 4325 transitions. [2019-12-27 13:38:09,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 4325 transitions. [2019-12-27 13:38:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:09,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:09,085 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:09,085 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-27 13:38:09,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:09,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586211735] [2019-12-27 13:38:09,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:09,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586211735] [2019-12-27 13:38:09,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:09,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:38:09,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811925770] [2019-12-27 13:38:09,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:38:09,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:09,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:38:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:38:09,239 INFO L87 Difference]: Start difference. First operand 1788 states and 4325 transitions. Second operand 11 states. [2019-12-27 13:38:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:09,512 INFO L93 Difference]: Finished difference Result 3218 states and 7882 transitions. [2019-12-27 13:38:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:38:09,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-27 13:38:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:09,515 INFO L225 Difference]: With dead ends: 3218 [2019-12-27 13:38:09,515 INFO L226 Difference]: Without dead ends: 2318 [2019-12-27 13:38:09,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:38:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-12-27 13:38:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2206. [2019-12-27 13:38:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-12-27 13:38:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 5235 transitions. [2019-12-27 13:38:09,538 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 5235 transitions. Word has length 95 [2019-12-27 13:38:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:09,538 INFO L462 AbstractCegarLoop]: Abstraction has 2206 states and 5235 transitions. [2019-12-27 13:38:09,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:38:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 5235 transitions. [2019-12-27 13:38:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:38:09,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:09,540 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:09,540 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-27 13:38:09,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:09,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825477628] [2019-12-27 13:38:09,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:38:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:38:09,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 13:38:09,626 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 13:38:09,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:38:09 BasicIcfg [2019-12-27 13:38:09,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 13:38:09,789 INFO L168 Benchmark]: Toolchain (without parser) took 65382.80 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.2 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 640.9 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,790 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.69 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 157.1 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.96 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,791 INFO L168 Benchmark]: Boogie Preprocessor took 41.41 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,791 INFO L168 Benchmark]: RCFGBuilder took 756.65 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 107.6 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,792 INFO L168 Benchmark]: TraceAbstraction took 63703.46 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 107.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 583.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:38:09,794 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.69 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 157.1 MB in the end (delta: -57.2 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.96 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.41 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 756.65 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 107.6 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63703.46 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 107.6 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 583.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2009; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2010; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.3s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8803 SDtfs, 9600 SDslu, 21729 SDs, 0 SdLazy, 9239 SolverSat, 658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 101 SyntacticMatches, 23 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 129551 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2689 ConstructedInterpolants, 0 QuantifiedInterpolants, 519881 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...